Files
freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.spanish.md
2018-10-11 02:15:05 +05:30

60 lines
1.8 KiB
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f39c1000cf542c50feae
challengeType: 5
title: 'Problem 47: Distinct primes factors'
videoUrl: ''
localeTitle: 'Problema 47: Factores primos distintos'
---
## Description
<section id="description"> Los primeros dos números consecutivos que tienen dos factores primos distintos son: <div style="padding-left: 4em;"> 14 = 2 × 7 </div><div style="padding-left: 4em;"> 15 = 3 × 5 </div> Los primeros tres números consecutivos que tienen tres factores primos distintos son: <div style="padding-left: 4em;"> 644 = 2² × 7 × 23 </div><div style="padding-left: 4em;"> 645 = 3 × 5 × 43 </div><div style="padding-left: 4em;"> 646 = 2 × 17 × 19 </div> Encuentre los primeros cuatro enteros consecutivos que tengan cuatro factores primos distintos cada uno. ¿Cuál es el primero de estos números? </section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
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.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function distinctPrimeFactors(targetNumPrimes, targetConsecutive) {
// Good luck!
return true;
}
distinctPrimeFactors(4, 4);
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>