freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.english.md
Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828)
* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown
2018-10-20 23:32:47 +05:30

876 B

id, challengeType, title
id challengeType title
5900f41f1000cf542c50ff32 5 Problem 179: Consecutive positive divisors

Description

Find the number of integers 1 < n < 107, for which n and n + 1 have the same number of positive divisors. For example, 14 has the positive divisors 1, 2, 7, 14 while 15 has 1, 3, 5, 15.

Instructions

Tests

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

Challenge Seed

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

euler179();

Solution

// solution required