61 lines
1019 B
Markdown
61 lines
1019 B
Markdown
|
---
|
|||
|
id: 5
|
|||
|
localeTitle: 5900f4531000cf542c50ff66
|
|||
|
challengeType: 5
|
|||
|
title: 'Problem 231: The prime factorisation of binomial coefficients'
|
|||
|
---
|
|||
|
|
|||
|
## Description
|
|||
|
<section id='description'>
|
|||
|
El coeficiente binomial 10C3 = 120.
|
|||
|
120 = 23 × 3 × 5 = 2 × 2 × 2 × 3 × 5, y 2 + 2 + 2 + 3 + 5 = 14.
|
|||
|
Así que la suma de los términos en el primo la factorización de 10C3 es 14.
|
|||
|
|
|||
|
Halla la suma de los términos en la factorización prima de 20000000C15000000.
|
|||
|
</section>
|
|||
|
|
|||
|
## Instructions
|
|||
|
<section id='instructions'>
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Tests
|
|||
|
<section id='tests'>
|
|||
|
|
|||
|
```yml
|
|||
|
tests:
|
|||
|
- text: <code>euler231()</code> debe devolver 7526965179680.
|
|||
|
testString: 'assert.strictEqual(euler231(), 7526965179680, "<code>euler231()</code> should return 7526965179680.");'
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Challenge Seed
|
|||
|
<section id='challengeSeed'>
|
|||
|
|
|||
|
<div id='js-seed'>
|
|||
|
|
|||
|
```js
|
|||
|
function euler231() {
|
|||
|
// Good luck!
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler231();
|
|||
|
```
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Solution
|
|||
|
<section id='solution'>
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|
|||
|
</section>
|