Flat 1 is named the first flat.
Flat 2 is named the second flat.
Flat 3 is named the third flat. And So On.....
A visitor decides to walk through all the flats, and he finds all the flats except flat 62.
Anmol later founds that the locals of the town have given it another name.
A man plots the murder of his wife. His plan is full proof. Nobody saw them leaving their house. He stabbed her with a knife while driving. She died on the spot. He threw her body in a valley. He threw the knife carefully wiping his finger prints on a random garbage bin. Then he went back to his home and no one was watching him this time as well.
After an hour, he was called by the local police department who informed him that his wife was murdered. They asked him to reach the scene of crime immediately. But as soon as he arrived at the crime scene, he was arrested by them.
How did the police know that he himself is the murderer?
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.
