freeCodeCamp/curriculum/challenges/portuguese/08-coding-interview-prep/project-euler/problem-9-special-pythagore...

1.8 KiB

id challengeType title videoUrl localeTitle
5900f3761000cf542c50fe88 5 Problem 9: Special Pythagorean triplet Problema 9: trigêmeo pitagórico especial

Description

Um trigêmeo pitagórico é um conjunto de três números naturais, um < b < c , para o qual,
a 2 + b 2 = c 2
Por exemplo, 3 2 + 4 2 = 9 + 16 = 25 = 5 2 . Existe exatamente um tripleto pitagórico para o qual a + b + c = 1000. Encontre o produto abc tal que a + b + c = n .

Instructions

Tests

tests:
  - text: <code>specialPythagoreanTriplet(1000)</code> deve retornar 31875000.
    testString: 'assert.strictEqual(specialPythagoreanTriplet(1000), 31875000, "<code>specialPythagoreanTriplet(1000)</code> should return 31875000.");'
  - text: <code>specialPythagoreanTriplet(24)</code> deve retornar 480.
    testString: 'assert.strictEqual(specialPythagoreanTriplet(24), 480, "<code>specialPythagoreanTriplet(24)</code> should return 480.");'
  - text: <code>specialPythagoreanTriplet(120)</code> deve retornar 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