MathDB

36

Part of 2008 National Olympiad First Round

Problems(1)

Turkey NMO 2008 1st Round - P36 (Combinatorics)

Source:

8/27/2012
There is a white table with a pile of 20082008 coins and there are two empty black tables. At each move, the uppermost coin on a table is transferred to an empty table or to the top of the pile on a non-empty table. What is the least number of moves required to reverse the pile at the beginning on the white table?
<spanclass=′latex−bold′>(A)</span> 6016<spanclass=′latex−bold′>(B)</span> 6017<spanclass=′latex−bold′>(C)</span> 6022<spanclass=′latex−bold′>(D)</span> 6023<spanclass=′latex−bold′>(E)</span> 6024 <span class='latex-bold'>(A)</span>\ 6016 \qquad<span class='latex-bold'>(B)</span>\ 6017 \qquad<span class='latex-bold'>(C)</span>\ 6022 \qquad<span class='latex-bold'>(D)</span>\ 6023 \qquad<span class='latex-bold'>(E)</span>\ 6024