ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
39 lines
930 B
Markdown
39 lines
930 B
Markdown
---
|
||
id: 5900f3f21000cf542c50ff04
|
||
title: 问题133：重新计算非因素
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-133-repunit-nonfactors
|
||
---
|
||
|
||
# --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）的因子。
|
||
|
||
# --hints--
|
||
|
||
`euler133()`应返回453647705。
|
||
|
||
```js
|
||
assert.strictEqual(euler133(), 453647705);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler133() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler133();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|