You are given 2 eggs.
You have access to a 100-storey building.
Eggs can be very hard or very fragile means it may break if dropped from the first floor or may not even break if dropped from 100th floor, Both eggs are identical.
You need to figure out the highest floor of a 100-storey building an egg can be dropped without breaking.
Now the question is how many drops you need to make. You are allowed to break 2 eggs in the process
Three playing cards in a row. Can you name them with these clues? There is a two to the right of a king. A diamond will be found to the left of a spade. An ace is to the left of a heart. A heart is to the left of a spade. Now, identify all three cards.
Katrina wants to go on a date and prefers her date to be tall, dark and handsome.
Of the preferred traits - tall, dark and handsome - no two of Shahrukh, Ajay, Salman and Akshay have the same number.
Only Shahrukh or Akshay is tall and fair.
Only Ajay or Salman is short and handsome.
Shahrukh and Salman are either both tall or short.
Ajay and Akshay are either both dark or both fair.
Who is Katrina's date?
A girl has as many brothers as sisters, but each brother has only half as many brothers as sisters. How many brothers and sisters are there in the family?
An octopus has 8 legs. A hippogriff has 6 legs and 2 pairs of wings. A sphinx has 6 legs and one pair of wings. Now we have all 3 kinds and a total of 18 insects in a cage. We have a total of 118 legs and 20 pairs of wings. How many insects do we have of each kind?
I am working in a bus company. The company recently went under expansion and therefore there was not enough room for all the buses. As a result, twelve buses had to be stored outside.
If the company decides to expand the garage space by forty percent, enough space to accommodate the current buses will be created leaving enough space for twelve more buses if the need arises in future.
Can you calculate the number of buses that the company owns at present?
In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki
