freeCodeCamp/problem-97-large-non-mersenne-prime.english.md at ef79ddd0de35a4e10b8b4588e67938f86d2bae10

Files

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

1.3 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f3ce1000cf542c50fee0	5	false	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() {
  // Good luck!
  return true;
}

lrgNonMersennePrime();

Solution

// solution required

1.3 KiB Raw Blame History Unescape Escape