* 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>
822 B
822 B
id, title, challengeType, videoUrl, dashedName
id | title | challengeType | videoUrl | dashedName |
---|---|---|---|---|
5900f3ce1000cf542c50fee0 | 问题97:大的非梅森素数 | 5 | problem-97-large-non-mersenne-prime |
--description--
1999年发现了第一个发现超过一百万个数字的已知素数,它是形式为26972593-1的梅森素数;它包含正好2,098,960位数字。随后发现其他形式为2p-1的梅森素数包含更多数字。然而,在2004年发现了一个巨大的非梅森素数,其中包含2,357,207个数字:28433×27830457 + 1。找到此素数的最后十位数字。
--hints--
euler97()
应该返回8739992577。
assert.strictEqual(euler97(), 8739992577);
--seed--
--seed-contents--
function lrgNonMersennePrime() {
return true;
}
lrgNonMersennePrime();
--solutions--
// solution required