32fac23a2d
* 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>
39 lines
727 B
Markdown
39 lines
727 B
Markdown
---
|
|
id: 5900f41f1000cf542c50ff32
|
|
title: 'Problem 179: Consecutive positive divisors'
|
|
challengeType: 5
|
|
forumTopicId: 301814
|
|
dashedName: problem-179-consecutive-positive-divisors
|
|
---
|
|
|
|
# --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
|
|
```
|