56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
---
|
||
id: 5900f4381000cf542c50ff4a
|
||
challengeType: 5
|
||
title: 'Problem 203: Squarefree Binomial Coefficients'
|
||
videoUrl: ''
|
||
localeTitle: 问题203:无平方二项系数
|
||
---
|
||
|
||
## Description
|
||
<section id="description">二项式系数nCk可以以三角形排列,Pascal的三角形,如下所示: <p> 111121133114641151010511615201561172135352171 ......... </p><p>可以看出Pascal三角形的前八行包含十二个不同的数字:1,2,3,4,5,6,7,10,15,20,21和35。 </p><p>如果没有素数的平方除n,则正整数n称为squarefree。在Pascal三角形的前八行中的十二个不同数字中,除了4和20之外的所有数字都是无方形的。前八行中不同的无平方数字的总和为105。 </p><p>找到Pascal三角形的前51行中不同的无平方数字的总和。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler203()</code>应该返回34029210557338。
|
||
testString: 'assert.strictEqual(euler203(), 34029210557338, "<code>euler203()</code> should return 34029210557338.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler203() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler203();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|