id	title	challengeType	forumTopicId	dashedName
5900f48f1000cf542c50ffa2	Problem 291: Panaitopol Primes	5	301943	problem-291-panaitopol-primes

--description--

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

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.

--hints--

euler291() should return 4037526.

assert.strictEqual(euler291(), 4037526);

function euler291() {

  return true;
}

euler291();

// solution required