fix(curriculum): clean-up Project Euler 181-200 (#42819)
* 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:
@ -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 < 108, have precisely two, not necessarily distinct, prime factors?
|
||||
How many composite integers, $n < {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--
|
||||
|
Reference in New Issue
Block a user