* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
866 B
866 B
id, title, challengeType, videoUrl, dashedName
id | title | challengeType | videoUrl | dashedName |
---|---|---|---|---|
5900f42c1000cf542c50ff3f | 问题192:最佳近似值 | 5 | problem-192-best-approximations |
--description--
设x是实数。对于分母界限d,x的最佳近似是简化形式的有理数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。
assert.strictEqual(euler192(), 57060635927998344);
--seed--
--seed-contents--
function euler192() {
return true;
}
euler192();
--solutions--
// solution required