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

fix(curriculum): clean-up Project Euler 181-200 (#42819)

Browse Source 
* fix: clean-up Project Euler 181-200

* fix: corrections from review

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

* fix: missing delimiter

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
This commit is contained in:
gikf
2021-07-15 15:52:14 +02:00
committed by GitHub
parent a9418a1fe9
commit 5a52c229f5
19 changed files with 204 additions and 144 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -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.
A composite is a number containing at least two prime factors. For example, $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.
How many composite integers, n &lt; 108, have precisely two, not necessarily distinct, prime factors?
How many composite integers, $n &lt; {10}^8$, have precisely two, not necessarily distinct, prime factors?
# --hints--
`euler187()` should return 17427258.
`semiPrimes()` should return `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--