gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
Files
main
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md
gikf 32fac23a2d fix(curriculum): clean-up Project Euler 161-180 (#42782) 
* fix: clean-up Project Euler 161-180

* fix: corrections from review

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
2021-07-12 16:19:03 +02:00

727 B
Raw Permalink Blame History

id, title, challengeType, forumTopicId, dashedName
id title challengeType forumTopicId dashedName
5900f41f1000cf542c50ff32 Problem 179: Consecutive positive divisors 5 301814 problem-179-consecutive-positive-divisors

--description--

Find the number of integers 1 &lt; n &lt; {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.

assert.strictEqual(consecutivePositiveDivisors(), 986262);

--seed--

--seed-contents--

function consecutivePositiveDivisors() {

  return true;
}

consecutivePositiveDivisors();

--solutions--

// solution required