freeCodeCamp

mirror of https://github.com/freeCodeCamp/freeCodeCamp.git

id	challengeType	title	forumTopicId
5900f48f1000cf542c50ffa2	5	Problem 291: Panaitopol Primes	301943

Description

A prime number p is called a Panaitopol prime if for some positive integersx and y.

Find how many Panaitopol primes are less than 5×1015.

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

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

euler291();

// solution required