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
771 B
Markdown
39 lines
771 B
Markdown
---
|
||
id: 5900f3a81000cf542c50febb
|
||
title: 问题60：素数对设置
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-60-prime-pair-sets
|
||
---
|
||
|
||
# --description--
|
||
|
||
素数3,7,109和673非常值得注意。通过取任何两个素数并以任何顺序连接它们，结果将始终是素数。例如，取7和109，7109和1097都是素数。这四个素数的总和，792，代表具有此属性的一组四个素数的最低和。找到一组五个素数的最低和，其中任何两个素数连接以产生另一个素数。
|
||
|
||
# --hints--
|
||
|
||
`euler60()`应返回26033。
|
||
|
||
```js
|
||
assert.strictEqual(euler60(), 26033);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function primePairSets() {
|
||
|
||
return true;
|
||
}
|
||
|
||
primePairSets();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|