43 lines
956 B
Markdown
43 lines
956 B
Markdown
|
---
|
||
|
|
id: 5900f3e91000cf542c50fefc
|
||
|
|
title: 'Problem 125: Palindromic sums'
|
||
|
|
challengeType: 5
|
||
|
|
forumTopicId: 301752
|
||
|
|
dashedName: problem-125-palindromic-sums
|
||
|
|
---
|
||
|
|
|
||
|
|
# --description--
|
||
|
|
|
||
|
|
The palindromic number 595 is interesting because it can be written as the sum of consecutive squares: 62 + 72 + 82 + 92 + 102 + 112 + 122.
|
||
|
|
|
||
|
|
There are exactly eleven palindromes below one-thousand that can be written as consecutive square sums, and the sum of these palindromes is 4164. Note that 1 = 02 + 12 has not been included as this problem is concerned with the squares of positive integers.
|
||
|
|
|
||
|
|
Find the sum of all the numbers less than 108 that are both palindromic and can be written as the sum of consecutive squares.
|
||
|
|
|
||
|
|
# --hints--
|
||
|
|
|
||
|
|
`euler125()` should return 2906969179.
|
||
|
|
|
||
|
|
```js
|
||
|
|
assert.strictEqual(euler125(), 2906969179);
|
||
|
|
```
|
||
|
|
|
||
|
|
# --seed--
|
||
|
|
|
||
|
|
## --seed-contents--
|
||
|
|
|
||
|
|
```js
|
||
|
|
function euler125() {
|
||
|
|
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
euler125();
|
||
|
|
```
|
||
|
|
|
||
|
|
# --solutions--
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|