56 lines
1.8 KiB
Markdown
56 lines
1.8 KiB
Markdown
---
|
||
id: 5900f4dd1000cf542c50ffef
|
||
challengeType: 5
|
||
title: 'Problem 368: A Kempner-like series'
|
||
videoUrl: ''
|
||
localeTitle: 问题368:类似肯珀纳的系列
|
||
---
|
||
|
||
## Description
|
||
<section id="description">谐波系列$ 1 + \ dfrac {1} {2} + \ dfrac {1} {3} + \ dfrac {1} {4} + ...众所周知是不同的。 <p>然而,如果我们在这个系列中省略了分母中有9个的每个项,则该系列显着地收敛到大约22.9206766193。这种改进的谐波系列称为肯普纳系列。 </p><p>现在让我们通过省略分母具有3个或更多相等连续数字的每个项的谐波系列来考虑另一个修正的谐波系列。可以验证在谐波系列的前1200个项中,仅省略20个项。这20个省略的术语是:$$ \ dfrac {1} {111},\ dfrac {1} {222},\ dfrac {1} {333},\ dfrac {1} {444},\ dfrac {1} { 555},\ dfrac {1} {666},\ dfrac {1} {777},\ dfrac {1} {888},\ dfrac {1} {999},\ dfrac {1} {1000},\ dfrac {1} {1110},\\ \ dfrac {1} {1111},\ dfrac {1} {1112},\ dfrac {1} {1113},\ dfrac {1} {1114},\ dfrac {1} {1115},\ dfrac {1} {1116},\ dfrac {1} {1117},\ dfrac {1} {1118},\ dfrac {1} {1119} $$ </p><p>这个系列也融合了。 </p><p>找到系列收敛的值。将您的答案四舍五入到小数点后面的10位数。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler368()</code>应该返回253.6135092068。
|
||
testString: 'assert.strictEqual(euler368(), 253.6135092068, "<code>euler368()</code> should return 253.6135092068.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler368() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler368();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|