freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.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

840 B
Raw Blame History

id, title, challengeType, videoUrl, dashedName
id title challengeType videoUrl dashedName
5900f5261000cf542c510038 问题441互质夫妇的反向总和 5 problem-441-the-inverse-summation-of-coprime-couples

--description--

对于整数M我们将RM定义为满足所有这些条件的所有整数对p和q的1 /p·q之和

1≤p<q≤Mp +q≥Mp和q是互质的。

我们还将SN定义为Ri的总和为2≤i≤N。我们可以验证S2= R2= 1/2S10≈6.9147和S100 ≈58.2962。

找到S107。将您的答案四舍五入到小数点后四位。

--hints--

euler441()应返回5000088.8395。

assert.strictEqual(euler441(), 5000088.8395);

--seed--

--seed-contents--

function euler441() {

  return true;
}

euler441();

--solutions--

// solution required