56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f3ef1000cf542c50ff01
|
||
challengeType: 5
|
||
title: 'Problem 129: Repunit divisibility'
|
||
videoUrl: ''
|
||
localeTitle: 问题129:重新划分可分性
|
||
---
|
||
|
||
## Description
|
||
<section id="description">完全由1组成的数字称为repunit。我们将R(k)定义为长度k的重新定位;例如,R(6)= 111111.假设n是正整数且GCD(n,10)= 1,则可以证明总是存在一个值k,其中R(k)可被n整除让A(n)成为k的最小值;例如,A(7)= 6且A(41)= 5.A(n)首先超过10的n的最小值是17.求出A(n)首先超过1的n的最小值 - 百万。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler129()</code>应该返回1000023。
|
||
testString: 'assert.strictEqual(euler129(), 1000023, "<code>euler129()</code> should return 1000023.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler129() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler129();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|