Files
freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md

22 lines
815 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters
This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.
---
id: 5900f3a51000cf542c50feb8
title: 问题57平方根收敛
challengeType: 5
videoUrl: ''
---
# --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是分子中位数超过分母中位数的第一个例子。在前一千次扩展中有多少分数包含一个数字比分母更多的分子
# --hints--
`euler57()`应返回153。
```js
assert.strictEqual(euler57(), 153);
```
# --solutions--