freeCodeCamp/curriculum/challenges/russian/08-coding-interview-prep/project-euler/problem-179-consecutive-pos...

56 lines
1.1 KiB
Markdown
Raw Blame History

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

---
id: 5900f41f1000cf542c50ff32
challengeType: 5
title: 'Problem 179: Consecutive positive divisors'
videoUrl: ''
localeTitle: 'Задача 179: последовательные положительные делители'
---
## Description
<section id="description"> Найдите число целых чисел 1 &lt;n &lt;107, для которых n и n + 1 имеют одинаковое число положительных делителей. Например, 14 имеет положительные делители 1, 2, 7, 14, а 15 - 1, 3, 5, 15. </section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler179()</code> должен возвращать 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>