56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f3a81000cf542c50febb
|
||
challengeType: 5
|
||
title: 'Problem 60: Prime pair sets'
|
||
videoUrl: ''
|
||
localeTitle: 问题60：素数对设置
|
||
---
|
||
|
||
## Description
|
||
<section id="description">素数3,7,109和673非常值得注意。通过取任何两个素数并以任何顺序连接它们，结果将始终是素数。例如，取7和109，7109和1097都是素数。这四个素数的总和，792，代表具有此属性的一组四个素数的最低和。找到一组五个素数的最低和，其中任何两个素数连接以产生另一个素数。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler60()</code>应返回26033。
|
||
testString: 'assert.strictEqual(euler60(), 26033, "<code>euler60()</code> should return 26033.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler60() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler60();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|