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

18
curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md
View File

@ -1,6 +1,6 @@
---
id: 5900f3731000cf542c50fe86
title: 'Problem 7: 10001st prime'
title: 'Problema 7: 10001esimo primo'
challengeType: 5
forumTopicId: 302182
dashedName: problem-7-10001st-prime
@ -8,43 +8,43 @@ dashedName: problem-7-10001st-prime
# --description--
By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
Elencando i primi sei numeri principali: 2, 3, 5, 7, 11 e 13, possiamo vedere che il sesto primo è 13.
What is the `n`th prime number?
Qual è il `n`-simo numero primo?
# --hints--
`nthPrime(6)` should return a number.
`nthPrime(6)` dovrebbe restituire un numero.
```js
assert(typeof nthPrime(6) === 'number');
```
`nthPrime(6)` should return 13.
`nthPrime(6)` dovrebbe restituire 13.
```js
assert.strictEqual(nthPrime(6), 13);
```
`nthPrime(10)` should return 29.
`nthPrime(10)` dovrebbe restituire 29.
```js
assert.strictEqual(nthPrime(10), 29);
```
`nthPrime(100)` should return 541.
`nthPrime(100)` dovrebbe restituire 541.
```js
assert.strictEqual(nthPrime(100), 541);
```
`nthPrime(1000)` should return 7919.
`nthPrime(1000)` dovrebbe restituire 7919.
```js
assert.strictEqual(nthPrime(1000), 7919);
```
`nthPrime(10001)` should return 104743.
`nthPrime(10001)` dovrebbe restituire 104743.
```js
assert.strictEqual(nthPrime(10001), 104743);