1.1 KiB
1.1 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f4451000cf542c50ff57 | 5 | Problem 216: Investigating the primality of numbers of the form 2n2-1 | Problema 216: Investigando a primalidade dos números da forma 2n2-1 |
Description
Quantos números t (n) são primos para n ≤ 50.000.000?
Instructions
Tests
tests:
- text: <code>euler216()</code> deve retornar 5437849.
testString: 'assert.strictEqual(euler216(), 5437849, "<code>euler216()</code> should return 5437849.");'
Challenge Seed
function euler216() {
// Good luck!
return true;
}
euler216();
Solution
// solution required