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.
From a pack of 52 cards, I placed 4 cards on the table.
I will give you 4 clues about the cards:
Clue 1: Card on left cannot be greater than the card on the right.
Clue 2: Difference between the 1st card and 3rd card is 8.
Clue 3: There is no card of an ace.
Clue 4: There are no face cards (queen, king, jacks).
Clue 5: Difference between the 2nd card and 4th card is 7.
A dead body is found outside a multi-story multinational company. The case is reported and a homicide detective is called on the crime scene.
He looks at the body and then towards the building. From the position of the body, it is evident that the victim committed suicide. He goes to the first floor of the building and then walks in the direction of the dead body, opens the window and toss a coin in the air.
He goes to second floor and again repeats the process. He keeps doing this till he is done on all the floors. Then he returns back to the floor and tells his team that it is a murder.
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).
A Shopkeeper sold a few chickens to four different customers on a particular day. It was such that each customer purchased half of the remaining chickens and half the chicken more.
Can you find out how many chicken were sold by the shopkeeper on that day if we tell you that the fourth customer bought a single chicken ?
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
