freeCodeCamp/curriculum/challenges/portuguese/08-coding-interview-prep/project-euler/problem-379-least-common-mu...

56 lines
1.0 KiB
Markdown
Raw Normal View History

---
id: 5900f4e81000cf542c50fffa
challengeType: 5
title: 'Problem 379: Least common multiple count'
videoUrl: ''
localeTitle: 'Problema 379: contagem múltipla menos comum'
---
## Description
<section id="description"> Seja f (n) o número de casais (x, y) com inteiros positivos xey, x ≤ y e o mínimo múltiplo comum de x e y igual a n. <p> Seja g a função somativa de f, ie: g (n) = ∑ f (i) para 1 ≤ i ≤ n. </p><p> Você é dado que g (106) = 37429395. </p><p> Encontre g (1012). </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler379()</code> deve retornar 132314136838185.
testString: 'assert.strictEqual(euler379(), 132314136838185, "<code>euler379()</code> should return 132314136838185.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler379() {
// Good luck!
return true;
}
euler379();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>