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

1.0 KiB

Raw Blame History

id, title, challengeType, forumTopicId, dashedName

id	title	challengeType	forumTopicId	dashedName
5900f3ce1000cf542c50fee0	Problem 97: Large non-Mersenne prime	5	302214	problem-97-large-non-mersenne-prime

--description--

The first known prime found to exceed one million digits was discovered in 1999, and is a Mersenne prime of the form 2^6972593−1; it contains exactly 2,098,960 digits. Subsequently other Mersenne primes, of the form 2^p−1, have been found which contain more digits.

However, in 2004 there was found a massive non-Mersenne prime which contains 2,357,207 digits: 28433×2^7830457+1.

Find the last ten digits of this prime number.

--hints--

lrgNonMersennePrime() should return a number.

assert(typeof lrgNonMersennePrime() === 'number');

lrgNonMersennePrime() should return 8739992577.

assert.strictEqual(lrgNonMersennePrime(), 8739992577);

--seed--

--seed-contents--

function lrgNonMersennePrime() {

  return true;
}

lrgNonMersennePrime();

--solutions--

// solution required

1.0 KiB Raw Blame History Unescape Escape