Peter wakes up daily to pick up his cycle and crosses the border between Spain and France daily with a bag on his shoulder. He is investigated daily by the officials but they don't find anything suspicious.
If we tell you that he is smuggling something what would it be?
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?
By using all numbers, i.e. 123456789 and subtraction/addition, operators number 100 can be formed in many ways.
Example: 98 + 7 + 6 - 5 - 4 - 3 + 2 - 1 = 100
But if we add a condition use of the number 32 is a must. Then there are limited solutions.
One of such solution is: 9 - 8 + 76 + 54 - 32 + 1 = 100
A research team went to a village somewhere between the jungles of Africa. Luckily for them, they reached the day when quite an interesting custom was to be performed. The custom was performed once a year as they confirmed and was performed in order to collect the taxes from every male of the region.
The taxes were to be paid in the form of grains. Everyone must pay pounds of grain equaling his respective age. This means a 20-year-old will have to pay 20 pounds of grain and a 30-year-old will pay 30 pounds of grain and so on.
The chief who collects the tax has 7 weights and a large 2-pan scale to weigh. But there is another custom that the chief can weigh only three of the seven weights.
Can you find out the weights of the seven weights? Also, what is the maximum age of the man that can be weighed for the payment of taxes?
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