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: 'Problema 441: La suma inversa de las parejas coprime'
|
|
---
|
|
|
|
## Description
|
|
<section id="description"> Para un entero M, definimos R (M) como la suma de 1 / (p · q) para todos los pares de enteros pyq que satisfacen todas estas condiciones: <p> 1 ≤ p <q ≤ M p + q ≥ M p y q son coprime. </p><p> También definimos S (N) como la suma de R (i) para 2 ≤ i ≤ N. Podemos verificar que S (2) = R (2) = 1/2, S (10) ≈ 6.9147 y S (100 ) ≈ 58.2962. </p><p> Encontrar S (107). Da tu respuesta redondeada a cuatro lugares decimales. </p></section>
|
|
|
|
## Instructions
|
|
<section id="instructions">
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler441()</code> debe devolver 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>
|