freeCodeCamp/curriculum/challenges/portuguese/08-coding-interview-prep/project-euler/problem-35-circular-primes....

66 lines
1.9 KiB
Markdown
Raw Normal View History

---
id: 5900f38f1000cf542c50fea2
challengeType: 5
title: 'Problem 35: Circular primes'
videoUrl: ''
localeTitle: 'Problema 35: Primários Circulares'
---
## Description
<section id="description"> O número, 197, é chamado de primo circular porque todas as rotações dos dígitos: 197, 971 e 719 são elas próprias primárias. Existem treze primos abaixo de 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79 e 97. Quantos primos circulares estão abaixo de n, enquanto 100 &lt;= n &lt; = 1000000? </section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>circularPrimes(100)</code> deve retornar 13.
testString: 'assert(circularPrimes(100) == 13, "<code>circularPrimes(100)</code> should return 13.");'
- text: <code>circularPrimes(100000)</code> deve retornar 43.
testString: 'assert(circularPrimes(100000) == 43, "<code>circularPrimes(100000)</code> should return 43.");'
- text: <code>circularPrimes(250000)</code> deve retornar 45.
testString: 'assert(circularPrimes(250000) == 45, "<code>circularPrimes(250000)</code> should return 45.");'
- text: <code>circularPrimes(500000)</code> deve retornar 49.
testString: 'assert(circularPrimes(500000) == 49, "<code>circularPrimes(500000)</code> should return 49.");'
- text: <code>circularPrimes(750000)</code> deve retornar 49.
testString: 'assert(circularPrimes(750000) == 49, "<code>circularPrimes(750000)</code> should return 49.");'
- text: <code>circularPrimes(1000000)</code> deve retornar 55.
testString: 'assert(circularPrimes(1000000) == 55, "<code>circularPrimes(1000000)</code> should return 55.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function circularPrimes(n) {
// Good luck!
return n;
}
circularPrimes(1000000);
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>