56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
---
|
||
id: 5900f3f21000cf542c50ff04
|
||
challengeType: 5
|
||
title: 'Problem 133: Repunit nonfactors'
|
||
videoUrl: ''
|
||
localeTitle: 问题133:重新计算非因素
|
||
---
|
||
|
||
## Description
|
||
<section id="description">完全由1组成的数字称为repunit。我们将R(k)定义为长度k的重新定位;例如,R(6)= 111111.让我们考虑R(10n)形式的重新组合。虽然R(10),R(100)或R(1000)不能被17整除,但R(10000)可被17整除。但是没有n的值,R(10n)将除以19。事实上,值得注意的是,11,17,41和73是低于100的唯一四个素数,可以是R(10n)的因子。求出十万以下所有素数的总和,这些素数永远不会是R(10n)的因子。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler133()</code>应返回453647705。
|
||
testString: 'assert.strictEqual(euler133(), 453647705, "<code>euler133()</code> should return 453647705.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler133() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler133();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|