56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
---
|
||
id: 5900f5261000cf542c510038
|
||
challengeType: 5
|
||
title: 'Problem 441: The inverse summation of coprime couples'
|
||
videoUrl: ''
|
||
localeTitle: 问题441:互质夫妇的反向总和
|
||
---
|
||
|
||
## Description
|
||
<section id="description">对于整数M,我们将R(M)定义为满足所有这些条件的所有整数对p和q的1 /(p·q)之和: <p> 1≤p<q≤Mp +q≥Mp和q是互质的。 </p><p>我们还将S(N)定义为R(i)的总和为2≤i≤N。我们可以验证S(2)= R(2)= 1/2,S(10)≈6.9147和S(100) )≈58.2962。 </p><p>找到S(107)。将您的答案四舍五入到小数点后四位。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler441()</code>应返回5000088.8395。
|
||
testString: 'assert.strictEqual(euler441(), 5000088.8395, "<code>euler441()</code> should return 5000088.8395.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler441() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler441();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|