Six glasses are in a row. The first three are filled with milk and the last three are empty. By moving only one glass, can you arrange them so that the full and the empty glasses alternate?
What is the four-digit number in which the first digit is one-third the second, the third is the sum of the first two, and the last is three times the second?
How many runs at maximum can a batsman score in a normal one-day match? Consider the fact that the conditions are ideal and there are no No Balls, no Wide Balls and no Extras in that match.
You walk into a creepy house by yourself. There is no electricity, plumbing, or ventilation. Inside you notice 3 doors with numbers on them. Once you open the doors you will die a particular way. Door No.1 You’ll be eaten by a lion who is hungry. Door No.2 You’ll be stabbed to death. Door No.3 There is an electric chair waiting for you. Which door do you pick?
A solo dice game is played. In this game, upon each turn, a normal pair of dice is rolled and the score is calculated not by adding the numbers but multiplying them.
In a particular game, the score for the second roll is five more than what was achieved in the first roll. The score for the third roll is six less than what was completed in the second roll. The score for the fourth roll is eleven more than what was achieved in the third. The score for the fifth roll is eight less than what was completed in the fourth.
Can you calculate the score for each of the five throws?
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
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
