---
id: 5900f52c1000cf542c51003f
challengeType: 5
title: 'Problem 448: Average least common multiple'
videoUrl: ''
localeTitle: 'Problema 448: Múltiplo menos comum comum'
---

## Description
<section id="description"> A função lcm (a, b) indica o menor múltiplo comum de a e b. Seja A (n) a média dos valores de lcm (n, i) para 1≤i≤n. Por exemplo: A (2) = (2 + 2) / 2 = 2 e A (10) = (10 + 10 + 30 + 20 + 10 + 30 + 70 + 40 + 90 + 10) / 10 = 32. <p> Seja S (n) = ∑A (k) para 1≤k≤n. S (100) = 122726. </p><p> Encontre S (99999999019) mod 999999017. </p></section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: ''
    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>