22afc2a0ca
Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com> Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com> Co-authored-by: Beau Carnes <beaucarnes@gmail.com>
61 lines
933 B
Markdown
61 lines
933 B
Markdown
---
|
||
id: 5900f3f11000cf542c50ff03
|
||
challengeType: 5
|
||
isHidden: false
|
||
title: 'Problem 132: Large repunit factors'
|
||
forumTopicId: 301760
|
||
---
|
||
|
||
## Description
|
||
<section id='description'>
|
||
A number consisting entirely of ones is called a repunit. We shall define R(k) to be a repunit of length k.
|
||
For example, R(10) = 1111111111 = 11×41×271×9091, and the sum of these prime factors is 9414.
|
||
Find the sum of the first forty prime factors of R(109).
|
||
</section>
|
||
|
||
## Instructions
|
||
<section id='instructions'>
|
||
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler132()</code> should return 843296.
|
||
testString: assert.strictEqual(euler132(), 843296);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler132() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler132();
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
</section>
|