Back to Freecodecamp

Problem 179: Consecutive positive divisors

curriculum/challenges/english/blocks/project-euler-problems-101-to-200/5900f41f1000cf542c50ff32.md

latest544 B
Original Source

--description--

Find the number of integers $1 < n < {10}^7$, 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.

--hints--

consecutivePositiveDivisors() should return 986262.

js
assert.strictEqual(consecutivePositiveDivisors(), 986262);

--seed--

--seed-contents--

js
function consecutivePositiveDivisors() {

  return true;
}

consecutivePositiveDivisors();

--solutions--

js
// solution required