2018-10-08 17:51:51 +00:00
---
2018-10-10 20:20:40 +00:00
id: 5900f3fe1000cf542c50ff11
2018-10-08 17:51:51 +00:00
challengeType: 5
title: 'Problem 146: Investigating a Prime Pattern'
2018-10-10 20:20:40 +00:00
videoUrl: ''
localeTitle: 'Problema 146: Investigando un patrón Prime'
2018-10-08 17:51:51 +00:00
---
## Description
2018-10-10 20:20:40 +00:00
< 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 >
2018-10-08 17:51:51 +00:00
## Instructions
2018-10-10 20:20:40 +00:00
< section id = "instructions" >
2018-10-08 17:51:51 +00:00
< / 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();
2018-10-10 20:20:40 +00:00
2018-10-08 17:51:51 +00:00
```
< / div >
< / section >
## Solution
< section id = 'solution' >
```js
// solution required
```
< / section >