* 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>
47 lines
920 B
Markdown
47 lines
920 B
Markdown
---
|
|
id: 5900f4381000cf542c50ff4b
|
|
title: 'Problem 204: Generalised Hamming Numbers'
|
|
challengeType: 5
|
|
forumTopicId: 301845
|
|
dashedName: problem-204-generalised-hamming-numbers
|
|
---
|
|
|
|
# --description--
|
|
|
|
A Hamming number is a positive number which has no prime factor larger than 5.
|
|
|
|
So the first few Hamming numbers are 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15.
|
|
|
|
There are 1105 Hamming numbers not exceeding 108.
|
|
|
|
We will call a positive number a generalised Hamming number of type n, if it has no prime factor larger than n. Hence the Hamming numbers are the generalised Hamming numbers of type 5.
|
|
|
|
How many generalised Hamming numbers of type 100 are there which don't exceed 109?
|
|
|
|
# --hints--
|
|
|
|
`euler204()` should return 2944730.
|
|
|
|
```js
|
|
assert.strictEqual(euler204(), 2944730);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler204() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler204();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|