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

56 lines
907 B
Markdown
Raw Normal View History

---
id: 5900f48f1000cf542c50ffa2
challengeType: 5
title: 'Problem 291: Panaitopol Primes'
videoUrl: ''
localeTitle: 'Problema 291: Panaitopol Primes'
---
## Description
<section id="description"> Um número primo p é chamado de primo de Panaitopol se para alguns inteiros positivosx e y. <p> Descubra quantos primos de Panaitopol têm menos de 5 × 1015. </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler291()</code> deve retornar 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>