56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
|
---
|
|||
|
|
id: 5900f3a51000cf542c50feb8
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 57: Square root convergents'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题57：平方根收敛
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">可以证明两个的平方根可以表示为无限连续分数。 √2= 1 + 1 /（2 + 1 /（2 + 1 /（2 + ...）））= 1.414213 ...通过扩展前四次迭代，得到：1 + 1/2 = 3 / 2 = 1.5 1 + 1 /（2 + 1/2）= 7/5 = 1.4 1 + 1 /（2 + 1 /（2 + 1/2））= 17/12 = 1.41666 ... 1 + 1 /（2 + 1 /（2 + 1 /（2 + 1/2）））= 41/29 = 1.41379 ...接下来的三次扩展是99 / 70,239 / 169和577/408，但是第八次扩展，1393/985，是分子中位数超过分母中位数的第一个例子。在前一千次扩展中，有多少分数包含一个数字比分母更多的分子？ </section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler57()</code>应返回153。
|
|||
|
|
testString: 'assert.strictEqual(euler57(), 153, "<code>euler57()</code> should return 153.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler57() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler57();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|