freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-97-large-non-mersen...

1.0 KiB
Raw Blame History

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 269725931; it contains exactly 2,098,960 digits. Subsequently other Mersenne primes, of the form 2p1, 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×27830457+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