freeCodeCamp

1.9 KiB

Raw Blame History

id	challengeType	title	videoUrl	localeTitle
5900f38f1000cf542c50fea2	5	Problem 35: Circular primes		Problema 35: primos circulares

Description

El número, 197, se llama primo circular porque todas las rotaciones de los dígitos: 197, 971 y 719, son primos. Hay trece de tales primos por debajo de 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79 y 97. ¿Cuántos primos circulares hay debajo de n, mientras que 100 <= n < = 1000000?

Instructions

Tests

tests:
  - text: <code>circularPrimes(100)</code> debe devolver 13.
    testString: 'assert(circularPrimes(100) == 13, "<code>circularPrimes(100)</code> should return 13.");'
  - text: <code>circularPrimes(100000)</code> debe devolver 43.
    testString: 'assert(circularPrimes(100000) == 43, "<code>circularPrimes(100000)</code> should return 43.");'
  - text: <code>circularPrimes(250000)</code> debe devolver 45.
    testString: 'assert(circularPrimes(250000) == 45, "<code>circularPrimes(250000)</code> should return 45.");'
  - text: <code>circularPrimes(500000)</code> debe devolver 49.
    testString: 'assert(circularPrimes(500000) == 49, "<code>circularPrimes(500000)</code> should return 49.");'
  - text: <code>circularPrimes(750000)</code> debe devolver 49.
    testString: 'assert(circularPrimes(750000) == 49, "<code>circularPrimes(750000)</code> should return 49.");'
  - text: <code>circularPrimes(1000000)</code> debe devolver 55.
    testString: 'assert(circularPrimes(1000000) == 55, "<code>circularPrimes(1000000)</code> should return 55.");'

Challenge Seed

function circularPrimes(n) {
  // Good luck!
  return n;
}

circularPrimes(1000000);

Solution

// solution required

1.9 KiB Raw Blame History