freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-461-almost-pi.spani...

63 lines
1.2 KiB
Markdown
Raw Normal View History

---
id: 5
localeTitle: 5900f53a1000cf542c51004c
challengeType: 5
title: 'Problem 461: Almost Pi'
---
## Description
<section id='description'>
Sea fn (k) = ek / n - 1, para todos los enteros no negativos k.
Notablemente, f200 (6) + f200 (75) + f200 (89) + f200 (226) = 3.141592644529… ≈ π.
De hecho, es la mejor aproximación de π de la forma fn (a) + fn (b) + fn (c) + fn (d) para n = 200.
Sea g (n) = a2 + b2 + c2 + d 2 para a, b, c, d que minimizan el error: | fn (a) + fn (b) + fn (c) + fn (d) - π |
(donde | x | denota el valor absoluto de x).
Le dan g (200) = 62 + 752 + 892 + 2262 = 64658.
Encuentre g (10000).
</section>
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler461()</code> debe devolver 159820276.
testString: 'assert.strictEqual(euler461(), 159820276, "<code>euler461()</code> should return 159820276.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler461() {
// Good luck!
return true;
}
euler461();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>