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 order to complete the racing competition, the Mexico racetrack has to submit its top and the most famous three horses to win the competition. Due to an electrical storm, all the records are cleared and no one knows which horse holds the record. They all look identical and it becomes even more difficult to differentiate the horses. There are 25 horses in the Mexico racetrack. But there can be only five horses at a time on the track. What will the least number of races that can be conducted to find out the three fastest horses?
Two guards were guarding the camp.Guard-1 was looking towards the south to make sure no threat is coming from the road.Guard-2 was looking at the north to make sure no threat is coming from the top. Suddenly Guard-1 ask the Guard-2 why he is smiling?How Guard-1 knows that Guard-2 is smiling?
A person is found murdered in his Chamber. When the crime scene is investigated, the Investigator find out that there is a calendar on which the victim has written a few numbers with his blood. The numbers are 4, 11, 11 and 4.
There are four suspects in the murder, John, Jacob, Anna and Lee. Can you find out who is the murderer?
Today is John's birthday.
A year ago, John had five candles and he lit all the candles except the one at the last.
Now he is going to light all the candles.
An apple seller is hosting a competition. He offers 1000 apples and 10 boxes to the people who pass by. The challenge is to put those 1000 apples in the 10 boxes in such a manner that if he asks for any amount of apples, the person can directly give him the boxes or a combination of boxes. If the person can do it, he promises to give a thousand apples for free.
If you happen to pass by the apple seller, will you be able to win a thousand apples?
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