Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md
Oliver Eyton-Williams ee1e8abd87 feat(curriculum): restore seed + solution to Chinese (#40683)
* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
2021-01-12 19:31:00 -07:00

640 B

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 < 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.

--hints--

euler179() should return 986262.

assert.strictEqual(euler179(), 986262);

--seed--

--seed-contents--

function euler179() {

  return true;
}

euler179();

--solutions--

// solution required