MathDB
Turkey NMO 2006 1st Round - P28 (Combinatorics)

Source:

February 3, 2013

Problem Statement

Ali who has 1010 candies eats at least one candy a day. In how many different ways can he eat all candies (according to distribution among days)?
<spanclass=latexbold>(A)</span> 64<spanclass=latexbold>(B)</span> 126<spanclass=latexbold>(C)</span> 243<spanclass=latexbold>(D)</span> 512<spanclass=latexbold>(E)</span> 1025 <span class='latex-bold'>(A)</span>\ 64 \qquad<span class='latex-bold'>(B)</span>\ 126 \qquad<span class='latex-bold'>(C)</span>\ 243 \qquad<span class='latex-bold'>(D)</span>\ 512 \qquad<span class='latex-bold'>(E)</span>\ 1025