There are hundred red gems and hundred blue gems. The blue gems are priceless while the red gems equal wastage. You have two sacks one labeled Heads and the other Tails. You have to distribute the gems as you want in the two sacks. Then a coin will be flipped and you will be asked to pick up a gem randomly from the corresponding sacks.
How will you distribute the gems between the sacks so that the odds of picking a Blue gem are maximum?
A frog is at the bottom of a 30-meter well. Each day he summons enough energy for one 3-meter leap up the well. Exhausted, he then hangs there for the rest of the day. At night, while he is asleep, he slips 2 meters backwards. How many days does it take him to escape from the well?
A landlord calls both of his sons and tells them that their horses will now decide who will transfer the inheritance. He tells them to race along the land till the end and the one whose horse will be slower will win and be the heir to all the property.
Both of them keep wandering for days but to no result. Then they ask a wise man regarding it. The man advises them on the matter after which they jump on the horses and race as fast as they can till the end. Why did they do it?
You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?
Rahul decided to meet Simran so he boards a local train from Bombay station. Just after the station, there is a 1km long tunnel. The train starts and is now accelerating. Rahul is a claustrophobic guy, so what is the best position for him to sit?
I am thinking of a five-digit number such that:
The first and last digits are the same, their submission is an even number and multiplication is an odd number and is equal to the fourth number. Subtract five from it and we obtain the second number. Then divide into exact halves and we get the 3rd number.
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
