56 lines
974 B
Markdown
56 lines
974 B
Markdown
---
|
||
id: 5900f3f11000cf542c50ff03
|
||
challengeType: 5
|
||
title: 'Problem 132: Large repunit factors'
|
||
videoUrl: ''
|
||
localeTitle: 问题132：大的重新安置因素
|
||
---
|
||
|
||
## Description
|
||
<section id="description">完全由1组成的数字称为repunit。我们将R（k）定义为长度k的重新定位。例如，R（10）= 1111111111 = 11×41×271×9091，并且这些素因子的总和是9414.求出R（109）的前40个素因子的总和。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler132()</code>应返回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();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|