56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
|
---
|
|||
|
id: 5900f39f1000cf542c50feb2
|
|||
|
challengeType: 5
|
|||
|
title: 'Problem 51: Prime digit replacements'
|
|||
|
videoUrl: ''
|
|||
|
localeTitle: 问题51:主要数字替换
|
|||
|
---
|
|||
|
|
|||
|
## Description
|
|||
|
<section id="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个素数值族的一部分。 </section>
|
|||
|
|
|||
|
## Instructions
|
|||
|
<section id="instructions">
|
|||
|
</section>
|
|||
|
|
|||
|
## Tests
|
|||
|
<section id='tests'>
|
|||
|
|
|||
|
```yml
|
|||
|
tests:
|
|||
|
- text: <code>euler51()</code>应返回121313。
|
|||
|
testString: 'assert.strictEqual(euler51(), 121313, "<code>euler51()</code> should return 121313.");'
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Challenge Seed
|
|||
|
<section id='challengeSeed'>
|
|||
|
|
|||
|
<div id='js-seed'>
|
|||
|
|
|||
|
```js
|
|||
|
function euler51() {
|
|||
|
// Good luck!
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler51();
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Solution
|
|||
|
<section id='solution'>
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|
|||
|
</section>
|