2018-10-08 17:51:51 +00:00
---
2018-10-10 20:20:40 +00:00
id: 5900f41f1000cf542c50ff32
2018-10-08 17:51:51 +00:00
challengeType: 5
title: 'Problem 179: Consecutive positive divisors'
2018-10-10 20:20:40 +00:00
videoUrl: ''
localeTitle: 'Problema 179: Divisores positivos consecutivos'
2018-10-08 17:51:51 +00:00
---
## Description
2018-10-10 20:20:40 +00:00
< section id = "description" > Encuentre el número de enteros 1 < n < 107, para los cuales n y n + 1 tienen el mismo número de divisores positivos. Por ejemplo, 14 tiene los divisores positivos 1, 2, 7, 14 mientras que 15 tiene 1, 3, 5, 15. < / 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 > euler179()</ code > debe devolver 986262.
testString: 'assert.strictEqual(euler179(), 986262, "< code > euler179()< / code > should return 986262.");'
```
< / section >
## Challenge Seed
< section id = 'challengeSeed' >
< div id = 'js-seed' >
```js
function euler179() {
// Good luck!
return true;
}
euler179();
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 >