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 | 问题216:调查2n2-1形式的数字的素数 |
Description
对于n≤50,000,000,有多少个数t(n)是素数?
Instructions
Tests
tests:
- text: <code>euler216()</code>应该返回5437849。
testString: 'assert.strictEqual(euler216(), 5437849, "<code>euler216()</code> should return 5437849.");'
Challenge Seed
function euler216() {
// Good luck!
return true;
}
euler216();
Solution
// solution required