ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
43 lines
779 B
Markdown
43 lines
779 B
Markdown
---
|
||
id: 5900f4291000cf542c50ff3a
|
||
title: 'Problem 187: Semiprimes'
|
||
challengeType: 5
|
||
forumTopicId: 301823
|
||
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.
|
||
|
||
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?
|
||
|
||
# --hints--
|
||
|
||
`euler187()` should return 17427258.
|
||
|
||
```js
|
||
assert.strictEqual(euler187(), 17427258);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler187() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler187();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|