Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md
Oliver Eyton-Williams 0bd52f8bd1 Feat: add new Markdown parser (#39800)
and change all the challenges to new `md` format.
2020-11-27 10:02:05 -08:00

40 lines
524 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f48f1000cf542c50ffa2
title: 'Problem 291: Panaitopol Primes'
challengeType: 5
forumTopicId: 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.
# --hints--
`euler291()` should return 4037526.
```js
assert.strictEqual(euler291(), 4037526);
```
# --seed--
## --seed-contents--
```js
function euler291() {
return true;
}
euler291();
```
# --solutions--
```js
// solution required
```