993 B
993 B
id | challengeType | title | forumTopicId |
---|---|---|---|
5900f4451000cf542c50ff57 | 5 | Problem 216: Investigating the primality of numbers of the form 2n2-1 | 301858 |
Description
How many numbers t(n) are prime for n ≤ 50,000,000 ?
Instructions
Tests
tests:
- text: <code>euler216()</code> should return 5437849.
testString: assert.strictEqual(euler216(), 5437849);
Challenge Seed
function euler216() {
// Good luck!
return true;
}
euler216();
Solution
// solution required