--- id: 5900f38f1000cf542c50fea2 challengeType: 5 title: 'Problem 35: Circular primes' videoUrl: '' localeTitle: 问题35:循环素数 --- ## Description
这个数字197被称为循环素数,因为数字的所有旋转:197,971和719本身都是素数。在100:2,3,5,7,11,13,17,31,37,71,73,79和97之下有十三个这样的素数。在n下面有多少个圆形素数,而100 <= n < = 1000000?
## Instructions
## Tests
```yml tests: - text: circularPrimes(100)应该返回13。 testString: 'assert(circularPrimes(100) == 13, "circularPrimes(100) should return 13.");' - text: circularPrimes(100000)应该返回43。 testString: 'assert(circularPrimes(100000) == 43, "circularPrimes(100000) should return 43.");' - text: circularPrimes(250000)应该返回45。 testString: 'assert(circularPrimes(250000) == 45, "circularPrimes(250000) should return 45.");' - text: circularPrimes(500000)应该返回49。 testString: 'assert(circularPrimes(500000) == 49, "circularPrimes(500000) should return 49.");' - text: circularPrimes(750000)应该返回49。 testString: 'assert(circularPrimes(750000) == 49, "circularPrimes(750000) should return 49.");' - text: circularPrimes(1000000)应该返回55。 testString: 'assert(circularPrimes(1000000) == 55, "circularPrimes(1000000) should return 55.");' ```
## Challenge Seed
```js function circularPrimes(n) { // Good luck! return n; } circularPrimes(1000000); ```
## Solution
```js // solution required ```