freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md

61 lines
1.0 KiB
Markdown
Raw Normal View History

---
id: 5900f3ba1000cf542c50fecd
title: 'Problem 78: Coin partitions'
challengeType: 5
forumTopicId: 302191
dashedName: problem-78-coin-partitions
---
# --description--
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.
<div style='text-align: center;'>
| Coin piles |
| ----------------- |
| OOOOO |
| OOOO   O |
| OOO   OO |
| OOO   O   O |
| OO   OO   O |
| OO   O   O   O |
| O   O   O   O   O |
</div>
Find the least value of `n` for which p(`n`) is divisible by one million.
# --hints--
`coinPartitions()` should return a number.
```js
assert(typeof coinPartitions() === 'number');
```
`coinPartitions()` should return 55374.
```js
assert.strictEqual(coinPartitions(), 55374);
```
# --seed--
## --seed-contents--
```js
function coinPartitions() {
return true;
}
coinPartitions();
```
# --solutions--
```js
// solution required
```