Files
Nicholas Carrigan (he/him) 3da4be21bb chore: seed chinese traditional (#42005)
Seeds the chinese traditional files manually so we can deploy to
staging.
2021-05-05 22:43:49 +05:30

566 B
Raw Permalink Blame History

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

--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.

--hints--

euler291() should return 4037526.

assert.strictEqual(euler291(), 4037526);

--seed--

--seed-contents--

function euler291() {

  return true;
}

euler291();

--solutions--

// solution required