ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
41 lines
566 B
Markdown
41 lines
566 B
Markdown
---
|
||
id: 5900f48f1000cf542c50ffa2
|
||
title: 'Problem 291: Panaitopol Primes'
|
||
challengeType: 5
|
||
forumTopicId: 301943
|
||
dashedName: 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.
|
||
|
||
```js
|
||
assert.strictEqual(euler291(), 4037526);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler291() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler291();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|