freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.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

564 B
Raw Blame History

id, title, challengeType, videoUrl, dashedName
id title challengeType videoUrl dashedName
5900f4651000cf542c50ff77 问题248Euler的totient函数等于13的数字 5 problem-248-numbers-for-which-eulers-totient-function-equals-13

--description--

φn= 13的第一个数字n是6227180929.找到第150,000个这样的数字。

--hints--

euler248()应返回23507044290。

assert.strictEqual(euler248(), 23507044290);

--seed--

--seed-contents--

function euler248() {

  return true;
}

euler248();

--solutions--

// solution required