James Bond is caught up in a mysterious scenario where the evil villain has him blindfolded. He somehow breaks through the handcuffs but is unable to get the blindfold off. Upon searching, he comes across a bow and 3 arrows. He can hear the villain speak, and thus tries to take a shot at him. He launches the first arrow, it misses the villain. He then launches the second arrow and it misses by a greater margin.
What is the probability that this third shot our James bond takes will be worse than the second shot?
Dwayne Johnson was running away with the loot from a heist in his car along with Vin Diesel. One tire was punctured and he dropped down to replace it. While changing the wheel, he dropped the four nuts that were holding the wheel and they fell into a drain. Vin Diesel gave him an idea using which they were able to drive till the rendezvous point.
Solve this tricky question. You are trapped in a forest. With you, you have a gun preloaded with two bullets in it. In front of you, there is a tiger, a leopard and a jaguar.
Two friends were stuck in a cottage. They had nothing to do and thus they started playing cards. Suddenly the power went off and Friend 1 inverted the position of 15 cards in the normal deck of 52 cards and shuffled it. Now he asked Friend 2 to divide the cards into two piles (need not be equal) with equal number of cards facing up. The room was quite dark and Friend 2 could not see the cards. He thinks for a while and then divides the cards in two piles.
On checking, the count of cards facing up is same in both the piles. How could Friend 2 have done it ?
A worker is to perform work for you for seven straight days. In return for his work, you will pay him 1/7th of a bar of gold per day. The worker requires a daily payment of 1/7th of the bar of gold. What and where are the fewest number of cuts to the bar of gold that will allow you to pay him 1/7th each day?
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