freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
Oliver Eyton-Williams ee1e8abd87
feat(curriculum): restore seed + solution to Chinese (#40683)
* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
2021-01-12 19:31:00 -07:00

1005 B
Raw Blame History

id, title, challengeType, videoUrl, dashedName
id title challengeType videoUrl dashedName
5900f4381000cf542c50ff4a 问题203无平方二项系数 5 problem-203-squarefree-binomial-coefficients

--description--

二项式系数nCk可以以三角形排列Pascal的三角形如下所示

111121133114641151010511615201561172135352171 .........

可以看出Pascal三角形的前八行包含十二个不同的数字1,2,3,4,5,6,7,10,15,20,21和35。

如果没有素数的平方除n则正整数n称为squarefree。在Pascal三角形的前八行中的十二个不同数字中除了4和20之外的所有数字都是无方形的。前八行中不同的无平方数字的总和为105。

找到Pascal三角形的前51行中不同的无平方数字的总和。

--hints--

euler203()应该返回34029210557338。

assert.strictEqual(euler203(), 34029210557338);

--seed--

--seed-contents--

function euler203() {

  return true;
}

euler203();

--solutions--

// solution required