Aptitude Questions

1. Every day I struggle at Auto Stand to give exact denomination to Auto Driver. This was recognized by Indian government (as most ppl struggle with denominations). The problem was to print minimum number of different notes, so that with their combination user should be able to give any number below 1000. But condition is to get the number he should use one note only once.
Ex: To get number 8. I can use 1+2+5..... No repitions are not allowed.

2. There are 2 cities A and B, dist. between them is 1000 Km
we have 3000 bananas in city A and a elephant can carry max 1000 bananas at
any given time and it needs to eat a banana every 1 Km.
How Many Max. No. of bananas one can transfer to city B?
Note : the elephant cannot go without bananas to eat.

Answers
1. Here’s my solution – 1, 2, 4, 8, 16, 32, 64, 128, 256, 512. – (10 notes)
2. Let 3 elephants carry it e1, e2, e3. e1 becomes donar till 334 km. e2 then becomes donar till 834 km. Then e3 starts having from his own for 166 km. So he can cary 835 bannanas.