mirror of
https://github.com/freeCodeCamp/freeCodeCamp.git
synced 2026-06-19 21:09:51 +08:00
fix(curriculum): Updated semiPrime test (#57298)
This commit is contained in:
parent
c7c333d6b2
commit
e6520b9010
@ -19,7 +19,7 @@ How many composite integers, $n < {10}^8$, have precisely two, not necessaril
|
||||
`semiPrimes()` should return `17427258`.
|
||||
|
||||
```js
|
||||
assert.strictEqual(euler187(), 17427258);
|
||||
assert.strictEqual(semiPrimes(), 17427258);
|
||||
```
|
||||
|
||||
# --seed--
|
||||
|
||||
Loading…
Reference in New Issue
Block a user