56 lines
1.0 KiB
Markdown
56 lines
1.0 KiB
Markdown
---
|
|
id: 5900f3fe1000cf542c50ff11
|
|
challengeType: 5
|
|
title: 'Problem 146: Investigating a Prime Pattern'
|
|
videoUrl: ''
|
|
localeTitle: 'Problema 146: Investigando un patrón Prime'
|
|
---
|
|
|
|
## Description
|
|
<section id="description"> El entero positivo n más pequeño para el que los números n2 + 1, n2 + 3, n2 + 7, n2 + 9, n2 + 13 y n2 + 27 son primos consecutivos es 10. La suma de todos estos enteros n es inferior a un millón es 1242490. <p> ¿Cuál es la suma de todos estos enteros n debajo de 150 millones? </p></section>
|
|
|
|
## Instructions
|
|
<section id="instructions">
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler146()</code> debe devolver 676333270.
|
|
testString: 'assert.strictEqual(euler146(), 676333270, "<code>euler146()</code> should return 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>
|