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>
47 lines
993 B
Markdown
47 lines
993 B
Markdown
---
|
||
id: 5900f4931000cf542c50ffa4
|
||
title: 问题293：伪幸运数
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-293-pseudo-fortunate-numbers
|
||
---
|
||
|
||
# --description--
|
||
|
||
如果偶数正整数N是2的幂或它的不同质数因子是连续质数，则称该数为偶数。
|
||
|
||
前十二个允许的数字是2,4,6,8,12,16,18,24,30,32,36,48。
|
||
|
||
如果允许N，则最小的整数M> 1，使得N + M为质数，将被称为N的伪幸运数。
|
||
|
||
例如，N = 630是可接受的，因为它是偶数，并且其不同的素数因子是连续的素数2,3,5和7。 631之后的下一个质数是641； 因此，630的伪幸运数为M = 11。 还可以看到，16的伪幸运数字是3。
|
||
|
||
找到所有小于109的允许数字N的所有唯一伪幸运数字之和。
|
||
|
||
# --hints--
|
||
|
||
`euler293()`应该返回2209。
|
||
|
||
```js
|
||
assert.strictEqual(euler293(), 2209);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler293() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler293();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|