freeCodeCamp/problem-97-large-non-mersenne-prime.md at 48c41e5a6abf46b9ce31d65d8289e06d65496e08

Files

Oliver Eyton-Williams 2b9e38a17b fix: replace .english.md extension with .md

2020-09-29 22:09:04 +02:00

1.3 KiB

Raw Blame History

id, challengeType, title, forumTopicId

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

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.

Instructions

Tests

tests:
  - text: <code>lrgNonMersennePrime()</code> should return a number.
    testString: assert(typeof lrgNonMersennePrime() === 'number');
  - text: <code>lrgNonMersennePrime()</code> should return 8739992577.
    testString: assert.strictEqual(lrgNonMersennePrime(), 8739992577);

Challenge Seed

function lrgNonMersennePrime() {

  return true;
}

lrgNonMersennePrime();

Solution

// solution required

1.3 KiB Raw Blame History Unescape Escape