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>
39 lines
820 B
Markdown
39 lines
820 B
Markdown
---
|
||
id: 5900f3f21000cf542c50ff05
|
||
title: 问题134：素对对连接
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-134-prime-pair-connection
|
||
---
|
||
|
||
# --description--
|
||
|
||
考虑连续的素数p1 = 19和p2 = 23.可以证实1219是最小的数字，使得最后的数字由p1形成，同时也可以被p2整除。实际上，除了p1 = 3和p2 = 5之外，对于每对连续质数，p2> p1，存在n的值，其中最后的数字由p1形成，n可以被p2整除。设S是n的这些值中最小的。找到每对连续质数的ΣS，其中5≤p1≤1000000。
|
||
|
||
# --hints--
|
||
|
||
`euler134()`应该返回18613426663617120。
|
||
|
||
```js
|
||
assert.strictEqual(euler134(), 18613426663617120);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler134() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler134();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|