56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f3db1000cf542c50feed
|
||
challengeType: 5
|
||
title: 'Problem 110: Diophantine Reciprocals II'
|
||
videoUrl: ''
|
||
localeTitle: 问题110：丢番图互惠II
|
||
---
|
||
|
||
## Description
|
||
<section id="description">在下面的等式中，x，y和n是正整数。 1 / <var>x</var> + 1 / <var>y</var> = 1 / <var>n</var>可以证实，当<var>n</var> = 1260时，存在113个不同的解，并且这是<var>n的</var>最小值，其中不同解的总数超过100。 <var>n的</var>最小值是多少，不同解决方案的数量超过四百万？ </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>diophantineTwo</code>应该返回9350130049860600。
|
||
testString: 'assert.strictEqual(diophantineTwo(), 9350130049860600, "<code>diophantineTwo()</code> should return 9350130049860600.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function diophantineTwo() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
diophantineTwo();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|