Three men in a cafe order a meal the total cost of which is $15. They each contribute $5. The waiter takes the money to the chef who recognises the three as friends and asks the waiter to return $5 to the men.
The waiter is not only poor at mathematics but dishonest and instead of going to the trouble of splitting the $5 between the three he simply gives them $1 each and pockets the remaining $2 for himself.
Now, each of the men effectively paid $4, the total paid is therefore $12. Add the $2 in the waiters pocket and this comes to $14. Where has the other $1 gone from the original $15?
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.
The chance of Mr John winning the lottery is 10%. All participants lined up and Mr John is 4th in the row. The first three participants lose the lottery.
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.
If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.
A boy purchased a book from a bookkeeper and gave him $100.
The cost of the book is $50 but the bookkeeper has no change, so he gets the change from the next shop and returns the boy his $50.
After some time the next shopkeeper came with the $100 note and told the bookkeeper that the note was a fraud, so he took the money back.
Three people enter a room and have a green or blue hat placed on their heads. They cannot see their own hat but can see the other hats.
The colour of each hat is purely random. They could all be green, blue, or any combination of green and blue.
They need to guess their own hat colour by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $10,000 each, but if anyone guesses incorrectly they all get nothing.
What is the best strategy?
