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.
For an extra income, John decided to work at a Hotel for one hour daily. The manager offers him that they will pay him $11 after every 11 days.
However, John offered a different proposition to the manager. The offers stand as:
He will be paid just a penny on his first day.
Two pence will be paid on the second day,
Four pence will be paid on the third day.
And so on till the 11th day.
You are a prisoner sentenced to death. The Emperor offers you a chance to live by playing a simple game. He gives you 50 black marbles, 50 white marbles, and 2 empty bowls. He then says, 'Divide these 100 marbles into these 2 bowls. You can divide them any way you like as long as you use all the marbles. Then I will blindfold you and mix the bowls around. You then can choose one bowl and remove ONE marble. If the marble is WHITE you will live, but if the marble is BLACK... you will die.'
How do you divide the marbles up so that you have the greatest probability of choosing a WHITE marble?
You have a thousand Re. 1 coins with you. You have ten bags with you and you can put any number of coins in each of the bags. The condition is that if someone asks you for any amount between 1 and 1000, you must be able to give that amount by just giving the bag (you are not allowed to open the bag and give coins).
There is a straight highway. Four different villages lie on that highway. The distance between them is different. The third village is 60km away from the first village; the fourth is 40 km away from the second; the third is 10 km near to the fourth that it is to the second.
Can you calculate the distance between the fourth and the first village ?
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