* 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>
649 B
649 B
id, title, challengeType, videoUrl, dashedName
id | title | challengeType | videoUrl | dashedName |
---|---|---|---|---|
5900f4d11000cf542c50ffe4 | 问题357:Prime生成整数 | 5 | problem-357-prime-generating-integers |
--description--
考虑30:1,2,3,5,6,10,15,30的除数。可以看出,对于每个除数d为30,d + 30 / d是素数。
找出所有正整数n的总和不超过100 000 000,这样对于n的每个除数d,d + n / d是素数。
--hints--
euler357()
应该返回1739023853137。
assert.strictEqual(euler357(), 1739023853137);
--seed--
--seed-contents--
function euler357() {
return true;
}
euler357();
--solutions--
// solution required