79d9012432
* fix(curriculum): tests quotes * fix(curriculum): fill seed-teardown * fix(curriculum): fix tests and remove unneeded seed-teardown
56 lines
876 B
Markdown
56 lines
876 B
Markdown
---
|
|
id: 5900f41f1000cf542c50ff32
|
|
challengeType: 5
|
|
title: 'Problem 179: Consecutive positive divisors'
|
|
---
|
|
|
|
## Description
|
|
<section id='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.
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler179()</code> should return 986262.
|
|
testString: assert.strictEqual(euler179(), 986262, '<code>euler179()</code> should return 986262.');
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler179() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler179();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
</section>
|