/*:
 # Coin partitions
 [Problem 78](https://projecteuler.net/problem=78) - Diifculty level: 30%

 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.

 ![](78-1.png)

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