61460c8601
search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
61 lines
910 B
Markdown
61 lines
910 B
Markdown
---
|
||
id: 5900f3fe1000cf542c50ff11
|
||
challengeType: 5
|
||
title: 'Problem 146: Investigating a Prime Pattern'
|
||
videoUrl: ''
|
||
localeTitle: 问题146：调查素数模式
|
||
---
|
||
|
||
## Description
|
||
<section id="description">
|
||
整数n2 + 1，n2 + 3，n2 + 7，n2 + 9，n2 + 13和n2 + 27为其连续质数的最小正整数n为10。所有小于100万的整数n的总和 是1242490。
|
||
|
||
所有小于1.5亿的整数n的总和是多少？
|
||
</section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler146()</code>应该返回676333270。
|
||
testString: assert.strictEqual(euler146(), 676333270);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler146() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler146();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|