1.0 KiB
1.0 KiB
id | challengeType | title | forumTopicId |
---|---|---|---|
5900f47e1000cf542c50ff90 | 5 | Problem 273: Sum of Squares | 301923 |
Description
For N=65 there are two solutions: a=1, b=8 and a=4, b=7. We call S(N) the sum of the values of a of all solutions of a2 + b2 = N, 0 ≤ a ≤ b, a, b and N integer. Thus S(65) = 1 + 4 = 5. Find ∑S(N), for all squarefree N only divisible by primes of the form 4k+1 with 4k+1 < 150.
Instructions
Tests
tests:
- text: <code>euler273()</code> should return 2032447591196869000.
testString: assert.strictEqual(euler273(), 2032447591196869000);
Challenge Seed
function euler273() {
// Good luck!
return true;
}
euler273();
Solution
// solution required