39 lines
580 B
Markdown
39 lines
580 B
Markdown
|
---
|
|||
|
|
id: 5900f3fa1000cf542c50ff0d
|
|||
|
|
title: 'Problem 142: Perfect Square Collection'
|
|||
|
|
challengeType: 5
|
|||
|
|
forumTopicId: 301771
|
|||
|
|
dashedName: problem-142-perfect-square-collection
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
# --description--
|
|||
|
|
|
|||
|
|
Find the smallest x + y + z with integers x > y > z > 0 such that x + y, x − y, x + z, x − z, y + z, y − z are all perfect squares.
|
|||
|
|
|
|||
|
|
# --hints--
|
|||
|
|
|
|||
|
|
`euler142()` should return 1006193.
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
assert.strictEqual(euler142(), 1006193);
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
# --seed--
|
|||
|
|
|
|||
|
|
## --seed-contents--
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler142() {
|
|||
|
|
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler142();
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
# --solutions--
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|