2018-10-08 17:51:51 +00:00
---
2018-10-10 20:20:40 +00:00
id: 5900f3f11000cf542c50ff03
2018-10-08 17:51:51 +00:00
challengeType: 5
title: 'Problem 132: Large repunit factors'
2018-10-10 20:20:40 +00:00
videoUrl: ''
localeTitle: 'Problema 132: Grandes factores de repunidad'
2018-10-08 17:51:51 +00:00
---
## Description
2018-10-10 20:20:40 +00:00
< section id = "description" > Un número que consiste enteramente en unos se llama repunit. Definiremos que R (k) es una repunidad de longitud k. Por ejemplo, R (10) = 1111111111 = 11 × 41 × 271 × 9091, y la suma de estos factores primos es 9414. Encuentre la suma de los primeros cuarenta factores primos de R (109). < / 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 > euler132()</ code > debe devolver 843296.
testString: 'assert.strictEqual(euler132(), 843296, "< code > euler132()< / code > should return 843296.");'
```
< / section >
## Challenge Seed
< section id = 'challengeSeed' >
< div id = 'js-seed' >
```js
function euler132() {
// Good luck!
return true;
}
euler132();
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 >