56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f3f21000cf542c50ff05
|
||
challengeType: 5
|
||
title: 'Problem 134: Prime pair connection'
|
||
videoUrl: ''
|
||
localeTitle: 问题134：素对对连接
|
||
---
|
||
|
||
## Description
|
||
<section id="description">考虑连续的素数p1 = 19和p2 = 23.可以证实1219是最小的数字，使得最后的数字由p1形成，同时也可以被p2整除。实际上，除了p1 = 3和p2 = 5之外，对于每对连续质数，p2> p1，存在n的值，其中最后的数字由p1形成，n可以被p2整除。设S是n的这些值中最小的。找到每对连续质数的ΣS，其中5≤p1≤1000000。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler134()</code>应该返回18613426663617120。
|
||
testString: 'assert.strictEqual(euler134(), 18613426663617120, "<code>euler134()</code> should return 18613426663617120.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler134() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler134();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|