58 lines
784 B
Markdown
58 lines
784 B
Markdown
---
|
||
id: 5900f3fa1000cf542c50ff0d
|
||
challengeType: 5
|
||
title: 'Problem 142: Perfect Square Collection'
|
||
forumTopicId: 301771
|
||
---
|
||
|
||
## Description
|
||
<section id='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.
|
||
</section>
|
||
|
||
## Instructions
|
||
<section id='instructions'>
|
||
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler142()</code> should return 1006193.
|
||
testString: assert.strictEqual(euler142(), 1006193);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler142() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler142();
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
</section>
|