freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.chinese.md

id	challengeType	title	videoUrl	localeTitle
5900f41f1000cf542c50ff32	5	Problem 179: Consecutive positive divisors		问题179：连续的正向除数

Description

求整数1 <n <107，其中n和n + 1具有相同的正除数。例如，14具有正除数1,2,7,14而15具有1,3,5,15。

Instructions

Tests

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

Challenge Seed

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

euler179();

Solution

// solution required