freeCodeCamp/curriculum/challenges/en/08-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.en.md

id, challengeType, title

id	challengeType	title
5900f3ce1000cf542c50fee0	5	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 26972593−1; it contains exactly 2,098,960 digits. Subsequently other Mersenne primes, of the form 2p−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×27830457+1. Find the last ten digits of this prime number.

Instructions

Tests

- text: <code>euler97()</code> should return 8739992577.
  testString: 'assert.strictEqual(euler97(), 8739992577, ''<code>euler97()</code> should return 8739992577.'');'

Challenge Seed

function euler97() {
  // Good luck!
  return true;
}

euler97();

Solution

// solution required