freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-192-best-approximat...

45 lines
866 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

---
id: 5900f42c1000cf542c50ff3f
title: 问题192最佳近似值
challengeType: 5
videoUrl: ''
dashedName: problem-192-best-approximations
---
# --description--
设x是实数。对于分母界限dx的最佳近似是简化形式的有理数r / s其中s≤d使得任何比r更接近x的有理数具有大于d的分母
| P / QX | <| r / sx | ⇒q> d
例如分母界限20的最佳近似值√13为18/5分母界限30的最佳近似值为√13为101/28。
找到分母1012的最佳逼近的所有分母的总和为√n其中n不是完美的正方形1 <n≤100000。
# --hints--
`euler192()`应该返回57060635927998344。
```js
assert.strictEqual(euler192(), 57060635927998344);
```
# --seed--
## --seed-contents--
```js
function euler192() {
return true;
}
euler192();
```
# --solutions--
```js
// solution required
```