Files
freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.spanish.md

65 lines
1.0 KiB
Markdown
Raw Normal View History

---
id: 5
localeTitle: 5900f52c1000cf542c51003f
challengeType: 5
title: 'Problem 448: Average least common multiple'
---
## Description
<section id='description'>
La función lcm (a, b) denota el mínimo común múltiplo de ay b.
Sea A (n) el promedio de los valores de mcm (n, i) para 1≤i≤n.
Por ejemplo: A (2) = (2 + 2) / 2 = 2 y A (10) = (10 + 10 + 30 + 20 + 10 + 30 + 70 + 40 + 90 + 10) / 10 = 32.
Sea S (n) = ∑A (k) para 1≤k≤n.
S (100) = 122726.
Encuentra S (99999999019) mod 999999017.
</section>
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler448()</code> debe devolver 106467648.
testString: 'assert.strictEqual(euler448(), 106467648, "<code>euler448()</code> should return 106467648.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler448() {
// Good luck!
return true;
}
euler448();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>