freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.english.md

id, challengeType, title

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

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, '<code>euler146()</code> should return 676333270.');

Challenge Seed

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

euler146();

Solution

// solution required