56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
|
---
|
|||
|
|
id: 5900f3ae1000cf542c50fec1
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 66: Diophantine equation'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题66：丢番图方程
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">考虑形式的二次丢番图方程：x2 - Dy2 = 1例如，当D = 13时，x中的最小解是6492 - 13×1802 = 1.可以假设当D是正整数时没有解广场。通过在D中找到D = {2,3,5,6,7}的最小解，我们得到以下结果：32 - 2×22 = 1 22 - 3×12 = 192 - 5×42 = 1 52 - 6× 22 = 1 82 - 7×32 = 1因此，通过考虑D中对于D≤7的最小解，当D = 5时获得最大的x。在x的最小解中找到D≤1000的值，其中获得x的最大值。 </section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler66()</code>应返回661。
|
|||
|
|
testString: 'assert.strictEqual(euler66(), 661, "<code>euler66()</code> should return 661.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler66() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler66();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|