bd68b70f3d
* fix: remove isHidden flag from frontmatter * fix: add isUpcomingChange Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com> * feat: hide blocks not challenges Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com> Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>
60 lines
914 B
Markdown
60 lines
914 B
Markdown
---
|
|
id: 5900f3fe1000cf542c50ff11
|
|
challengeType: 5
|
|
title: 'Problem 146: Investigating a Prime Pattern'
|
|
forumTopicId: 301775
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
The smallest positive integer n for which the numbers n2+1, n2+3, n2+7, n2+9, n2+13, and n2+27 are consecutive primes is 10. The sum of all such integers n below one-million is 1242490.
|
|
|
|
What is the sum of all such integers n below 150 million?
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler146()</code> should return 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>
|