1.8 KiB
		
	
	
	
	
	
	
	
			
		
		
	
	
			1.8 KiB
		
	
	
	
	
	
	
	
id, challengeType, title, videoUrl, localeTitle
| id | challengeType | title | videoUrl | localeTitle | 
|---|---|---|---|---|
| 5900f3761000cf542c50fe88 | 5 | Problem 9: Special Pythagorean triplet | Problema 9: triplete pitagórico especial | 
Description
 a 2 + b 2 = c 2 
 Por ejemplo, 3 2 + 4 2 = 9 + 16 = 25 = 5 2 . Existe exactamente un triplete de Pitágoras para el cual a + b + c = 1000. Encuentre el producto abc tal que a + b + c = n . Instructions
Tests
tests:
  - text: <code>specialPythagoreanTriplet(1000)</code> debe devolver 31875000.
    testString: 'assert.strictEqual(specialPythagoreanTriplet(1000), 31875000, "<code>specialPythagoreanTriplet(1000)</code> should return 31875000.");'
  - text: <code>specialPythagoreanTriplet(24)</code> debe devolver 480.
    testString: 'assert.strictEqual(specialPythagoreanTriplet(24), 480, "<code>specialPythagoreanTriplet(24)</code> should return 480.");'
  - text: <code>specialPythagoreanTriplet(120)</code> debe devolver 49920.
    testString: 'assert.strictEqual(specialPythagoreanTriplet(120), 49920, "<code>specialPythagoreanTriplet(120)</code> should return 49920.");'
Challenge Seed
function specialPythagoreanTriplet(n) {
 let sumOfabc = n;
 // Good luck!
 return true;
}
specialPythagoreanTriplet(1000);
Solution
// solution required