ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
49 lines
757 B
Markdown
49 lines
757 B
Markdown
---
|
|
id: 5900f3d91000cf542c50feeb
|
|
title: 'Problem 108: Diophantine Reciprocals I'
|
|
challengeType: 5
|
|
forumTopicId: 301732
|
|
dashedName: problem-108-diophantine-reciprocals-i
|
|
---
|
|
|
|
# --description--
|
|
|
|
In the following equation x, y, and n are positive integers.
|
|
|
|
1/`x` + 1/`y` = 1/`n`
|
|
|
|
For `n` = 4 there are exactly three distinct solutions:
|
|
|
|
1/5 + 1/20 = 1/4
|
|
1/6 + 1/12 = 1/4
|
|
1/8 + 1/8 = 1/4
|
|
|
|
What is the least value of `n` for which the number of distinct solutions exceeds one-thousand?
|
|
|
|
# --hints--
|
|
|
|
`diophantineOne()` should return 180180.
|
|
|
|
```js
|
|
assert.strictEqual(diophantineOne(), 180180);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function diophantineOne() {
|
|
|
|
return true;
|
|
}
|
|
|
|
diophantineOne();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|