This website is a semi-functional mirror of the original Project Euler. More information is available on GitHub.
projecteuler.net

Coin partitions

Problem 78

Published on 10 September 2004 at 06:00 pm [Server Time]

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.

OOOOO
OOOO   O
OOO   OO
OOO   O   O
OO   OO   O
OO   O   O   O
O   O   O   O   O

Find the least value of n for which p(n) is divisible by one million.


Answer:
Go to back to Problems