56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
---
|
||
id: 5900f39d1000cf542c50feb0
|
||
challengeType: 5
|
||
title: 'Problem 49: Prime permutations'
|
||
videoUrl: ''
|
||
localeTitle: 问题49：主要排列
|
||
---
|
||
|
||
## Description
|
||
<section id="description">算术序列1487,4817,8147，其中每个项增加3330，在两个方面是不寻常的：（i）三个项中的每一个都是素数，并且，（ii）每个4位数字是彼此的排列。没有由三个1位，2位或3位数的素数组成的算术序列，表现出这种性质，但还有另外一个4位数的增加序列。你通过连接这个序列中的三个术语来形成12位数字？ </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>primePermutations()</code>应该返回296962999629。
|
||
testString: 'assert.strictEqual(primePermutations(), 296962999629, "<code>primePermutations()</code> should return 296962999629.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function primePermutations() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
primePermutations();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|