freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.spanish.md

id, localeTitle, challengeType, title

id	localeTitle	challengeType	title
5	5900f39c1000cf542c50feae	5	Problem 47: Distinct primes factors

Description

Los dos primeros números consecutivos que tienen dos factores primos distintos son:

14 = 2 × 7

15 = 3 × 5

Los primeros tres números consecutivos que tienen tres factores primos distintos son:

644 = 2² × 7 × 23

645 = 3 × 5 × 43

646 = 2 × 17 × 19

Encuentre los primeros cuatro enteros consecutivos que tengan cuatro factores primos distintos cada uno. ¿Cuál es el primero de estos números?

Instructions

Tests

tests:
  - text: ' <code>distinctPrimeFactors(2, 2)</code> debe devolver 14.'
    testString: 'assert.strictEqual(distinctPrimeFactors(2, 2), 14, "<code>distinctPrimeFactors(2, 2)</code> should return 14.");'
  - text: ' <code>distinctPrimeFactors(3, 3)</code> debe devolver 644.'
    testString: 'assert.strictEqual(distinctPrimeFactors(3, 3), 644, "<code>distinctPrimeFactors(3, 3)</code> should return 644.");'
  - text: ' <code>distinctPrimeFactors(4, 4)</code> debe devolver 134043.'
    testString: 'assert.strictEqual(distinctPrimeFactors(4, 4), 134043, "<code>distinctPrimeFactors(4, 4)</code> should return 134043.");'

Challenge Seed

function distinctPrimeFactors(targetNumPrimes, targetConsecutive) {
  // Good luck!
  return true;
}

distinctPrimeFactors(4, 4);

Solution

function distinctPrimeFactors(targetNumPrimes, targetConsecutive) {

  function isPrime(num) {
    for (let i = 2, s = Math.sqrt(num); i <= s; i++) {
      if (num % i === 0) {
        return false;
      }
    }
    return num !== 1;
  }

  function getPrimeFactors(num) {
    const factors = [];
    for (let i = 2; i <= Math.sqrt(num); i++) {
      if (num % i === 0) {
        // found a factor
        if (isPrime(i)) {
          factors.push(i);
        }
        if (isPrime(num / i) && i !== Math.sqrt(num)) {
          factors.push(num / i);
        }
      }
    }
    return factors;
  }

  function findConsecutiveNumbers() {
    let number = 0;
    let consecutive = 0;
    while (consecutive < targetConsecutive) {
      number++;
      if (getPrimeFactors(number).length >= targetNumPrimes) {
        consecutive++;
    } else {
        consecutive = 0;
      }
    }
    return (number - targetConsecutive) + 1;
  }

  return findConsecutiveNumbers();
  }