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.
You have 1023 apples and 10 bags. You have to distribute these apples in these 10 bags in any way you choose. But when I ask for a certain number of apples you have to give them in terms of bags without transferring the apples from other bags. How do you distribute the apples?
A four-digit number (not beginning with 0) can be represented by ABCD. There is one number such that ABCD=A^B*C^D, where A^B means A raised to the B power. Can you find it?