1) An envelope has space for at most three stamps. If you are given three stamps of denomination 1, and three stamps of denomination a(a>1) the least positive integer for which there is no stamp value is........
I'm not able to understand what the problem is about...Please help.
2) Ten trucks numbered 1 to 10, are carrying packets of sugar. Each packet weight either 999g or 1000g and each truck carries only packets of equal weights. The combined weight of 1packet selected from the first truck,2 packets selected from the second, 4 packet from the third, and so on and 2^9 packets from the tenth truck is 1022870g. The truck that have the lighter bags are: (A)1,3,5 (B)2,4,5 (C)1,9 (D)2,8
How to do this problem??