56 lines
1.0 KiB
Markdown
56 lines
1.0 KiB
Markdown
---
|
||
id: 5900f4531000cf542c50ff66
|
||
challengeType: 5
|
||
title: 'Problem 231: The prime factorisation of binomial coefficients'
|
||
videoUrl: ''
|
||
localeTitle: 问题231：二项式系数的素因子化
|
||
---
|
||
|
||
## Description
|
||
<section id="description">二项式系数10C3 = 120. 120 = 23×3×5 = 2×2×2×3×5，并且2 + 2 + 2 + 3 + 5 = 14.因此，素数因子分解中的项的总和为10C3是14岁。 <p>找出素数因子分解中的术语总和为20000000C15000000。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler231()</code>应该返回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>
|