bfc21e4c40
* fix: clean-up Project Euler 141-160 * fix: corrections from review Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com> * fix: corrections from review Co-authored-by: Tom <20648924+moT01@users.noreply.github.com> * fix: use different notation for consistency * Update curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md Co-authored-by: gikf <60067306+gikf@users.noreply.github.com> Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com> Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
39 lines
658 B
Markdown
39 lines
658 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--
|
||
|
||
`perfectSquareCollection()` should return `1006193`.
|
||
|
||
```js
|
||
assert.strictEqual(perfectSquareCollection(), 1006193);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function perfectSquareCollection() {
|
||
|
||
return true;
|
||
}
|
||
|
||
perfectSquareCollection();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|