933 B
933 B
id | challengeType | title | forumTopicId |
---|---|---|---|
5900f5361000cf542c510048 | 5 | Problem 457: A polynomial modulo the square of a prime | 302131 |
Description
Let SR(L) be ∑R(p) for all primes not exceeding L.
Find SR(107).
Instructions
Tests
tests:
- text: <code>euler457()</code> should return 2647787126797397000.
testString: assert.strictEqual(euler457(), 2647787126797397000);
Challenge Seed
function euler457() {
// Good luck!
return true;
}
euler457();
Solution
// solution required