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
908 B
Markdown
45 lines
908 B
Markdown
---
|
||
id: 5900f3f51000cf542c50ff07
|
||
title: 'Problem 136: Singleton difference'
|
||
challengeType: 5
|
||
forumTopicId: 301764
|
||
dashedName: problem-136-singleton-difference
|
||
---
|
||
|
||
# --description--
|
||
|
||
The positive integers, $x$, $y$, and $z$, are consecutive terms of an arithmetic progression. Given that $n$ is a positive integer, the equation, $x^2 − y^2 − z^2 = n$, has exactly one solution when $n = 20$:
|
||
|
||
$$13^2 − 10^2 − 7^2 = 20$$
|
||
|
||
In fact, there are twenty-five values of $n$ below one hundred for which the equation has a unique solution.
|
||
|
||
How many values of $n$ less than fifty million have exactly one solution?
|
||
|
||
# --hints--
|
||
|
||
`singletonDifference()` should return `2544559`.
|
||
|
||
```js
|
||
assert.strictEqual(singletonDifference(), 2544559);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function singletonDifference() {
|
||
|
||
return true;
|
||
}
|
||
|
||
singletonDifference();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|