56 lines
872 B
Markdown
56 lines
872 B
Markdown
---
|
||
id: 5900f4d11000cf542c50ffe4
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
title: 问题357：Prime生成整数
|
||
---
|
||
|
||
## Description
|
||
<section id="description">考虑30：1,2,3,5,6,10,15,30的除数。可以看出，对于每个除数d为30，d + 30 / d是素数。 <p>找出所有正整数n的总和不超过100 000 000，这样对于n的每个除数d，d + n / d是素数。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler357()</code>应该返回1739023853137。
|
||
testString: assert.strictEqual(euler357(), 1739023853137);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler357() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler357();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|