freeCodeCamp/curriculum/challenges/russian/08-coding-interview-prep/project-euler/problem-132-large-repunit-f...

58 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: 5900f3f11000cf542c50ff03
challengeType: 5
title: 'Problem 132: Large repunit factors'
forumTopicId: 301760
localeTitle: 'Задача 132: Большие факторы репутации'
---
## Description
<section id='description'>
Число, состоящее полностью из них, называется repunit. Определим R (k) как репутацию длины k. Например, R (10) = 1111111111 = 11 × 41 × 271 × 9091, а сумма этих простых коэффициентов равна 9414. Найдите сумму первых сорока простых множителей R (109).
</section>
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler132()</code> should return 843296.
testString: assert.strictEqual(euler132(), 843296);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler132() {
// Good luck!
return true;
}
euler132();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>