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

id	challengeType	title	videoUrl	localeTitle
5900f48f1000cf542c50ffa2	5	Problem 291: Panaitopol Primes		Problema 291: Panaitopol Primes

Description

Um número primo p é chamado de primo de Panaitopol se para alguns inteiros positivosx e y.

Descubra quantos primos de Panaitopol têm menos de 5 × 1015.

Instructions

Tests

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

Challenge Seed

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

euler291();

Solution

// solution required