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
John was so frustrated to be the suspect of being a sleeper terrorist that he shoot himself right between the eyes with a revolver in his toilet. The revolver and the bullets were accurate. Minutes later John walks out of the toilet unharmed.
How can this be possible?
You walk into a room where there are three primates held in their respective cages:
1) A lion who is eating the flesh of a goat.
2) An orangutan who is playing with blocks.
3) A donkey who is sitting idle.
Pronounced as one letter,
And written with three,
Two letters there are,
And two only in me.
I am double, I am single,
I am black blue and grey,
I am read from both ends,
And the same either way.
John gave half of the apples he had plus one more to Jacob. He gave half of the remaining ones plus one more to James. Now, John was left with just one apple.
Can you find out how many did he have in the beginning?
From a pack of 52 cards, I placed 4 cards on the table.
I will give you 4 clues about the cards:
Clue 1: Card on left cannot be greater than the card on the right.
Clue 2: Difference between the 1st card and 3rd card is 8.
Clue 3: There is no card of an ace.
Clue 4: There are no face cards (queen, king, jacks).
Clue 5: Difference between the 2nd card and 4th card is 7.
A game is being played where eight players can last for thirty-five minutes. Six substitutes alternate with each player in this game. Thus, all players are on the pitch for the same amount of time including the substitutes.
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
