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

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

Description

undefined

Instructions

undefined

Tests

tests:
  - text: ''
    testString: 'assert.strictEqual(distinctPrimeFactors(2, 2), 14, "<code>distinctPrimeFactors(2, 2)</code> should return 14.");'
  - text: ''
    testString: 'assert.strictEqual(distinctPrimeFactors(3, 3), 644, "<code>distinctPrimeFactors(3, 3)</code> should return 644.");'
  - text: ''
    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

// solution required