67 lines
1.0 KiB
Markdown
67 lines
1.0 KiB
Markdown
---
|
||
id: 5900f3ba1000cf542c50fecd
|
||
challengeType: 5
|
||
title: 'Problem 78: Coin partitions'
|
||
---
|
||
|
||
## Description
|
||
<section id='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.
|
||
|
||
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.
|
||
</section>
|
||
|
||
## Instructions
|
||
<section id='instructions'>
|
||
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler78()</code> should return 55374.
|
||
testString: assert.strictEqual(euler78(), 55374, '<code>euler78()</code> should return 55374.');
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler78() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler78();
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
</section>
|