freeCodeCamp/problem-146-investigating-a-prime-pattern.md at 48c41e5a6abf46b9ce31d65d8289e06d65496e08

Files

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

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

899 B

Raw Blame History

id, challengeType, title, forumTopicId

id	challengeType	title	forumTopicId
5900f3fe1000cf542c50ff11	5	Problem 146: Investigating a Prime Pattern	301775

Description

The smallest positive integer n for which the numbers n2+1, n2+3, n2+7, n2+9, n2+13, and n2+27 are consecutive primes is 10. The sum of all such integers n below one-million is 1242490.

What is the sum of all such integers n below 150 million?

Instructions

Tests

tests:
  - text: <code>euler146()</code> should return 676333270.
    testString: assert.strictEqual(euler146(), 676333270);

Challenge Seed

function euler146() {

  return true;
}

euler146();

Solution

// solution required

899 B Raw Blame History