freeCodeCamp/curriculum/challenges/en/08-coding-interview-prep/project-euler/problem-291-panaitopol-primes.en.md

id, challengeType, title

id	challengeType	title
5900f48f1000cf542c50ffa2	5	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.

Instructions

Tests

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

Challenge Seed

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

euler291();

Solution

// solution required