statement.html

problem 78 · 13 lines

<div class="problem_content" role="problem">
<p>Let $p(n)$ represent the number of different ways in which $n$ coins can be separated into piles. For example, five coins can be separated into piles in exactly seven different ways, so $p(5)=7$.</p>
<div class="margin_left">
OOOOO<br/>
OOOO   O<br/>
OOO   OO<br/>
OOO   O   O<br/>
OO   OO   O<br/>
OO   O   O   O<br/>
O   O   O   O   O
</div>
<p>Find the least value of $n$ for which $p(n)$ is divisible by one million.</p>
</div>