1.1 KiB
1.1 KiB
id | challengeType | title | forumTopicId |
---|---|---|---|
5900f4711000cf542c50ff84 | 5 | Problem 261: Pivotal Square Sums | 301910 |
Description
(k-m)2 + ... + k2 = (n+1)2 + ... + (n+m)2.
Some small square-pivots are 4: 32 + 42 = 52 21: 202 + 212 = 292 24: 212 + 222 + 232 + 242 = 252 + 262 + 272 110: 1082 + 1092 + 1102 = 1332 + 1342Find the sum of all distinct square-pivots ≤ 1010.
Instructions
Tests
tests:
- text: <code>euler261()</code> should return 238890850232021.
testString: assert.strictEqual(euler261(), 238890850232021);
Challenge Seed
function euler261() {
// Good luck!
return true;
}
euler261();
Solution
// solution required