freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-132-large-repunit-f...

22 lines
477 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

---
id: 5900f3f11000cf542c50ff03
title: 问题132大的重新安置因素
challengeType: 5
videoUrl: ''
---
# --description--
完全由1组成的数字称为repunit。我们将Rk定义为长度k的重新定位。例如R10= 1111111111 = 11×41×271×9091并且这些素因子的总和是9414.求出R109的前40个素因子的总和。
# --hints--
`euler132()`应返回843296。
```js
assert.strictEqual(euler132(), 843296);
```
# --solutions--