7907f62337
* fix: clean-up Project Euler 121-140 * fix: corrections from review Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com> * fix: missing backticks Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com> * fix: corrections from review Co-authored-by: Tom <20648924+moT01@users.noreply.github.com> * fix: missing delimiter Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com> Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com> Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
45 lines
905 B
Markdown
45 lines
905 B
Markdown
---
|
||
id: 5900f3f31000cf542c50ff06
|
||
title: 'Problem 135: Same differences'
|
||
challengeType: 5
|
||
forumTopicId: 301763
|
||
dashedName: problem-135-same-differences
|
||
---
|
||
|
||
# --description--
|
||
|
||
Given the positive integers, $x$, $y$, and $z$, are consecutive terms of an arithmetic progression, the least value of the positive integer, $n$, for which the equation, $x^2 − y^2 − z^2 = n$, has exactly two solutions is $n = 27$:
|
||
|
||
$$34^2 − 27^2 − 20^2 = 12^2 − 9^2 − 6^2 = 27$$
|
||
|
||
It turns out that $n = 1155$ is the least value which has exactly ten solutions.
|
||
|
||
How many values of $n$ less than one million have exactly ten distinct solutions?
|
||
|
||
# --hints--
|
||
|
||
`sameDifferences()` should return `4989`.
|
||
|
||
```js
|
||
assert.strictEqual(sameDifferences(), 4989);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function sameDifferences() {
|
||
|
||
return true;
|
||
}
|
||
|
||
sameDifferences();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|