gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(i18n,learn): processed translations (#45165)

Browse Source
This commit is contained in:
camperbot
2022-02-19 12:56:08 +05:30
committed by GitHub
parent 8138a07d52
commit ba14990876
134 changed files with 1540 additions and 1511 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
View File

@ -1,6 +1,6 @@
---
id: 5900f38f1000cf542c50fea2
title: 'Problem 35: Circular primes'
title: 'Problema 35: Primi circolari'
challengeType: 5
forumTopicId: 302009
dashedName: problem-35-circular-primes
@ -8,55 +8,55 @@ dashedName: problem-35-circular-primes
# --description--
The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.
Il numero 197 è chiamato un primo circolare perché tutte le rotazioni delle cifre: 197, 971 e 719, sono esse stesse prime.
There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.
Ci sono tredici di questi primi sotto il 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79 e 97.
How many circular primes are there below `n`, whereas 100 ≤ `n` ≤ 1000000?
Quanti primi circolari ci sono sotto `n`, dove 100 ≤ `n` ≤ 1000000?
**Note:**
**Nota:**
Circular primes individual rotation can exceed `n`.
La rotazione individuale di primi circolari può superare `n`.
# --hints--
`circularPrimes(100)` should return a number.
`circularPrimes(100)` dovrebbe restituire un numero.
```js
assert(typeof circularPrimes(100) === 'number');
```
`circularPrimes(100)` should return 13.
`circularPrimes(100)` dovrebbe restituire 13.
```js
assert(circularPrimes(100) == 13);
```
`circularPrimes(100000)` should return 43.
`circularPrimes(100000)` dovrebbe restituire 43.
```js
assert(circularPrimes(100000) == 43);
```
`circularPrimes(250000)` should return 45.
`circularPrimes(250000)` dovrebbe restituire 45.
```js
assert(circularPrimes(250000) == 45);
```
`circularPrimes(500000)` should return 49.
`circularPrimes(500000)` dovrebbe restituire 49.
```js
assert(circularPrimes(500000) == 49);
```
`circularPrimes(750000)` should return 49.
`circularPrimes(750000)` dovrebbe restituire 49.
```js
assert(circularPrimes(750000) == 49);
```
`circularPrimes(1000000)` should return 55.
`circularPrimes(1000000)` dovrebbe restituire 55.
```js
assert(circularPrimes(1000000) == 55);