E-Store
An interesting pne... everyone's invited
|
| Forum Index -> Algebra -> View Full Question |
|
| Author | Message | |||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
I got it this way -> Just going about it in the backward way solves it ,ie - After all the cards are on the table , then -> 1 step -> We pick up a card from the table and place it on the top of the pile of cards 2 step -> Now , put the card from the bottom on the top We find that 1999 comes on top in a stack of -> 3 , 6 ,12 , 24 ,..........., 1536 So the cards left are 2000 - 1536 = 464 on the table Now , again continuing the procedure we place the card from the table on the top and then the bottom card on the top , until the last card is left which is placed on the top (In this step the bottom card is not place on the top , cos we need to have the original pile) Hence , total cards above 1999 in original pile are 2*463 + 1 = 927
|
|||||||||||||
Impossible To be Impossible is Impossible |
||||||||||||||
| Like 0 people liked this | ||||||||||||||
|
|
||||||||||||||
Preparing for IIT-JEE ?
Arihant Revision Package for IIT JEE - Books, Practice Tests + Rank Predictor
@ INR 1,995/-
For Quick Info
|
|
|
|
|
| 35,229,755 Engineering Questions Attempted |
6,69,530 Visitors Monthly |
79 Engg. Exam Covered |
1211 Students Currently Online |
Connect with Us  |
 |
