67 lines
1.0 KiB
Markdown
67 lines
1.0 KiB
Markdown
---
|
|
id: 5
|
|
localeTitle: 5900f3ba1000cf542c50fecd
|
|
challengeType: 5
|
|
title: 'Problem 78: Coin partitions'
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
Deje que p (n) represente el número de formas diferentes en las que n monedas se pueden separar en pilas. Por ejemplo, cinco monedas se pueden separar en pilas exactamente de siete maneras diferentes, por lo que p (5) = 7.
|
|
|
|
OOOOO
|
|
OOOO O
|
|
OOO OO
|
|
OOO O O
|
|
OO OO O
|
|
OO O O O
|
|
O O O O O
|
|
|
|
Encontrar el menor valor de n para el que p (n) es divisible por un millón.
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler78()</code> debe devolver 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>
|