A boy was at a carnival and went to a booth where a man said to the boy, "If I write your exact weight on this piece of paper then you have to give me $50, but if I cannot, I will pay you $50." The boy looked around and saw no scale so he agrees, thinking no matter what the carny writes he'll just say he weighs more or less. In the end the boy ended up paying the man $50. How did the man win the bet?
John is on an island and there are three crates of fruit that have washed up in front of him. One crate contains only apples. One crate contains only oranges. The other crate contains both apples and oranges.
Each crate is labelled. One reads 'apples', one reads 'oranges', and one reads 'apples and oranges'. He know that NONE of the crates have been labeled correctly - they are all wrong.
If he can only take out and look at just one of the pieces of fruit from just one of the crates, how can he label all of the crates correctly?
In the Chess Board picture below white army is arranged. You need to add a black army on the board such that no piece is under any threat.
Note: Army comprised of 1 king, 1 queen, 2 rooks, 2 bishops, 2 knights, and 8 pawns.
Chocolate costs 6 rupees and a Toy costs 5 rupees. If you have 32 rupees in total, how many chocolates and how many Toys can be purchased with that amount?
In the following picture, E is going to slide the object down and as per the terrain and the physics, the round object is going to travel all the way till the end. Now, can you analyze who all people will die when it happens?
John needs to purchase 100 chocolates from three different shops and he has exactly 100 rupees to do that which he must spend entirely. He must buy at least 1 Chocolate from each shop.
The first shop is selling each chocolate at 5 paise, the second is selling at 1 rupee and the third is selling at 5 rupees.
15 caves are arranged in a circle at the temple of doom. One of these caves has the treasure of gems and wealth. Each day the treasure keepers can move the treasure to an adjacent cave or can keep it in the same cave. Every day two treasure seekers visit the place and have enough time to enter any two caves of their choice.
How do the treasure seekers ensure that they find the treasure in the minimum number of possible days?