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

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

Browse Source
This commit is contained in:
camperbot
2022-03-01 00:52:39 +05:30
committed by GitHub
parent b8667061a1
commit 18e5be9efa
91 changed files with 1112 additions and 888 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-187-semiprimes.md
View File

@ -1,6 +1,6 @@
---
id: 5900f4291000cf542c50ff3a
title: 'Problem 187: Semiprimes'
title: 'Problema 187 Semiprimi'
challengeType: 5
forumTopicId: 301823
dashedName: problem-187-semiprimes
@ -8,15 +8,15 @@ dashedName: problem-187-semiprimes
# --description--
A composite is a number containing at least two prime factors. For example, 15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3.
Un composito è un numero contenente almeno due fattori principali. Ad esempio, $15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3 $.
There are ten composites below thirty containing precisely two, not necessarily distinct, prime factors: 4, 6, 9, 10, 14, 15, 21, 22, 25, 26.
Ci sono dieci numeri compositi sotto trenta che contengono esattamente due, non necessariamente distinti, fattori primi: 4, 6, 9, 10, 14, 15, 21, 22, 25, 26.
How many composite integers, n < 108, have precisely two, not necessarily distinct, prime factors?
Quanti numeri interi compositi, $n < {10}^8$, hanno precisamente due, non necessariamente distinti, fattori primi?
# --hints--
`euler187()` should return 17427258.
`semiPrimes()` dovrebbe restituire `17427258`.
```js
assert.strictEqual(euler187(), 17427258);
@ -27,12 +27,12 @@ assert.strictEqual(euler187(), 17427258);
## --seed-contents--
```js
function euler187() {
function semiPrimes() {
return true;
}
euler187();
semiPrimes();
```
# --solutions--