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

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.1 KiB

Raw Blame History

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

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

1.1 KiB Raw Blame History Unescape Escape