2018-10-08 17:51:51 +00:00
---
2018-10-10 20:20:40 +00:00
id: 5900f4451000cf542c50ff57
2018-10-08 17:51:51 +00:00
challengeType: 5
title: 'Problem 216: Investigating the primality of numbers of the form 2n2-1'
2018-10-10 20:20:40 +00:00
videoUrl: ''
localeTitle: 'Problema 216: Investigación de la primalidad de los números de la forma 2n2-1'
2018-10-08 17:51:51 +00:00
---
## Description
2018-10-10 20:20:40 +00:00
< section id = "description" > Considere los números t (n) de la forma t (n) = 2n2-1 con n> 1. Los primeros números son 7, 17, 31, 49, 71, 97, 127 y 161. Resulta que solo 49 = 7 * 7 y 161 = 7 * 23 no son primos. Para n ≤ 10000 hay 2202 números t (n) que son primos. < p > ¿Cuántos números t (n) son primos para n ≤ 50,000,000? </ 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 > euler216()</ code > debe devolver 5437849.
testString: 'assert.strictEqual(euler216(), 5437849, "< code > euler216()< / code > should return 5437849.");'
```
< / section >
## Challenge Seed
< section id = 'challengeSeed' >
< div id = 'js-seed' >
```js
function euler216() {
// Good luck!
return true;
}
euler216();
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 >