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>
39 lines
740 B
Markdown
39 lines
740 B
Markdown
---
|
||
id: 5900f3db1000cf542c50feed
|
||
title: 问题110：丢番图互惠II
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-110-diophantine-reciprocals-ii
|
||
---
|
||
|
||
# --description--
|
||
|
||
在下面的等式中，x，y和n是正整数。 1 / `x` + 1 / `y` = 1 / `n`可以证实，当`n` = 1260时，存在113个不同的解，并且这是`n的`最小值，其中不同解的总数超过100。 `n的`最小值是多少，不同解决方案的数量超过四百万？
|
||
|
||
# --hints--
|
||
|
||
`diophantineTwo`应该返回9350130049860600。
|
||
|
||
```js
|
||
assert.strictEqual(diophantineTwo(), 9350130049860600);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function diophantineTwo() {
|
||
|
||
return true;
|
||
}
|
||
|
||
diophantineTwo();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|