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>
44 lines
809 B
Markdown
44 lines
809 B
Markdown
---
|
|
id: 5900f4791000cf542c50ff8b
|
|
title: >-
|
|
Problem 268: Counting numbers with at least four distinct prime factors less
|
|
than 100
|
|
challengeType: 5
|
|
forumTopicId: 301917
|
|
dashedName: >-
|
|
problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100
|
|
---
|
|
|
|
# --description--
|
|
|
|
It can be verified that there are 23 positive integers less than 1000 that are divisible by at least four distinct primes less than 100.
|
|
|
|
Find how many positive integers less than 1016 are divisible by at least four distinct primes less than 100.
|
|
|
|
# --hints--
|
|
|
|
`euler268()` should return 785478606870985.
|
|
|
|
```js
|
|
assert.strictEqual(euler268(), 785478606870985);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler268() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler268();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|