freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-291-panaitopol-prim...

60 lines
858 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

---
id: 5
localeTitle: 5900f48f1000cf542c50ffa2
challengeType: 5
title: 'Problem 291: Panaitopol Primes'
---
## Description
<section id='description'>
Un número primo p se llama un primo de Panaitopol si para algunos enterosx e y positivos.
Halla cuántos primos de Panaitopol son menores que 5 × 1015.
</section>
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler291()</code> debe devolver 4037526.
testString: 'assert.strictEqual(euler291(), 4037526, "<code>euler291()</code> should return 4037526.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler291() {
// Good luck!
return true;
}
euler291();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>