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
981 B
Markdown
39 lines
981 B
Markdown
---
|
||
id: 5900f39f1000cf542c50feb2
|
||
title: 问题51：主要数字替换
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-51-prime-digit-replacements
|
||
---
|
||
|
||
# --description--
|
||
|
||
通过替换2位数\* 3的第1位，可以看出9个可能值中的6个：13,23,43,53,73和83都是素数。通过用相同的数字替换56 \*\* 3的第3和第4位数字，这个5位数字是在10个生成的数字中具有7个素数的第一个例子，产生该族：56003,56113,56333,56443,56663,56773因此56003，作为这个家族的第一个成员，是拥有这个属性的最小的素数。找到最小的素数，通过用相同的数字替换部分数字（不一定是相邻的数字），它是8个素数值族的一部分。
|
||
|
||
# --hints--
|
||
|
||
`euler51()`应返回121313。
|
||
|
||
```js
|
||
assert.strictEqual(euler51(), 121313);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function primeDigitReplacements() {
|
||
|
||
return true;
|
||
}
|
||
|
||
primeDigitReplacements();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|