freeCodeCamp/problem-146-investigating-a-prime-pattern.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

930 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

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

euler146();

Solution

// solution required

930 B Raw Blame History