gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(i8n,learn): processed translations

Browse Source
This commit is contained in:
Crowdin Bot
2021-02-06 04:42:36 +00:00
committed by Mrugesh Mohapatra
parent 15047f2d90
commit e5c44a3ae5
3274 changed files with 172122 additions and 14164 deletions
Download Patch File Download Diff File Expand all files Collapse all files

29
curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/emirp-primes.md
View File

@ -1,24 +1,37 @@
---
id: 599d0ba974141b0f508b37d5
title: Emirp奖金
title: Emirp primes
challengeType: 5
videoUrl: ''
forumTopicId: 302253
dashedName: emirp-primes
---
# --description--
<p>一个emirp（向后拼写的主要拼写）是素数，当它们被反转时（在它们的十进制表示中）是一个不同的素数。 </p><p>编写应能功能：显示前<b>n</b> eprimes numbers.Show在range.Show的eprimes数字eprimes的在range.Show <b><sup>第</sup> n <sup>个</sup></b> eprimes数目。 </p><p>该函数应该有两个参数。第一个将接收<b>n</b>或作为数组的范围。第二个将接收一个布尔值，它指定函数是否将eprimes作为数组或单个数字（范围中的素数或第<b>n <sup>个</sup></b>素数）返回。根据参数，函数应返回数组或数字。 </p>
An emirp (**prime** spelled backwards) are primes that when reversed (in their decimal representation) are a different prime.
# --instructions--
Write a function that:
<ul>
<li>Shows the first <code>n</code> emirp numbers.</li>
<li>Shows the emirp numbers in a range.</li>
<li>Shows the number of emirps in a range.</li>
<li>Shows the <code>n<sup>th</sup></code> emirp number.</li>
</ul>
The function should accept two parameters. The first will receive `n` or the range as an array. The second will receive a boolean, that specifies if the function returns the emirps as an array or a single number (the number of primes in the range or the <code>n<sup>th</sup></code> prime). According to the parameters the function should return an array or a number.
# --hints--
`emirps`是一个功能。
`emirps` should be a function.
```js
assert(typeof emirps === 'function');
```
`emirps(20,true)`应该返回`[13,17,31,37,71,73,79,97,107,113,149,157,167,179,199,311,337,347,359,389]`
`emirps(20,true)` should return `[13,17,31,37,71,73,79,97,107,113,149,157,167,179,199,311,337,347,359,389]`
```js
assert.deepEqual(emirps(20, true), [
@ -45,13 +58,13 @@ assert.deepEqual(emirps(20, true), [
]);
```
`emirps(10000)`应该返回`948349`
`emirps(1000)` should return `70529`
```js
assert.deepEqual(emirps(1000), 70529);
```
`emirps([7700,8000],true)`应该返回`[7717,7757,7817,7841,7867,7879,7901,7927,7949,7951,7963]`
`emirps([7700,8000],true)` should return `[7717,7757,7817,7841,7867,7879,7901,7927,7949,7951,7963]`
```js
assert.deepEqual(emirps([7700, 8000], true), [
@ -69,7 +82,7 @@ assert.deepEqual(emirps([7700, 8000], true), [
]);
```
`emirps([7700,8000],true)`应该返回`11`
`emirps([7700,8000],true)` should return `11`
```js
assert.deepEqual(emirps([7700, 8000], false), 11);