2018-10-08 17:51:51 +00:00
---
2018-10-10 20:20:40 +00:00
id: 5900f4e81000cf542c50fffa
2018-10-08 17:51:51 +00:00
challengeType: 5
title: 'Problem 379: Least common multiple count'
2018-10-10 20:20:40 +00:00
videoUrl: ''
localeTitle: 'Problema 379: Recuento múltiple menos común'
2018-10-08 17:51:51 +00:00
---
## Description
2018-10-10 20:20:40 +00:00
< section id = "description" > Sea f (n) el número de parejas (x, y) con x e y enteros positivos, x ≤ y y el mínimo común múltiplo de x e y igual a n. < p > Sea g la función sumatoria de f, es decir: g (n) = ∑ f (i) para 1 ≤ i ≤ n. < / p > < p > Se le da que g (106) = 37429395. < / p > < p > Encontrar g (1012). < / p > < / section >
2018-10-08 17:51:51 +00:00
## Instructions
2018-10-10 20:20:40 +00:00
< section id = "instructions" >
2018-10-08 17:51:51 +00:00
< / section >
## Tests
< section id = 'tests' >
```yml
tests:
- text: < code > euler379()</ code > debe devolver 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();
2018-10-10 20:20:40 +00:00
2018-10-08 17:51:51 +00:00
```
< / div >
< / section >
## Solution
< section id = 'solution' >
```js
// solution required
```
< / section >