freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-132-large-repunit-factors.chinese.md

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3f11000cf542c50ff03	5	Problem 132: Large repunit factors		问题132：大的重新安置因素

Description

完全由1组成的数字称为repunit。我们将R（k）定义为长度k的重新定位。例如，R（10）= 1111111111 = 11×41×271×9091，并且这些素因子的总和是9414.求出R（109）的前40个素因子的总和。

Instructions

Tests

tests:
  - text: <code>euler132()</code>应返回843296。
    testString: 'assert.strictEqual(euler132(), 843296, "<code>euler132()</code> should return 843296.");'

Challenge Seed

function euler132() {
  // Good luck!
  return true;
}

euler132();

Solution

// solution required