function findTriplet(sum) {
// Loop through possible values for 'a'
// We only check up to sum/3 because 'a' must be the smallest in the triplet
for (let a = 1; a <= sum / 3; a++) {
// Loop through possible values for 'b', starting just above 'a'
// It goes only up to sum/2 to avoid redundancy and ensure 'b < c'
for (let b = a + 1; b <= sum / 2; b++) {
// Calculate 'c' as the remaining value so that a + b + c = sum
let c = sum - a - b;
// Check if the triplet (a, b, c) satisfies the Pythagorean condition
// That is, a² + b² must equal c²
if (a * a + b * b === c * c) {
console.log(`(${a}^2 = ${a * a}) + (${b}^2 = ${b * b}) = ${c}^2 = ${c * c}`);
console.log(`a = ${a}, b = ${b}, c = ${c}`);
console.log(`${a} + ${b} + ${c} = ${a + b + c}`);
}
}
}
}
// Define the total sum of the Pythagorean triplet (a + b + c = 1000)
const sum = 1000;
findTriplet(sum);
/*
run:
(200^2 = 40000) + (375^2 = 140625) = 425^2 = 180625
a = 200, b = 375, c = 425
200 + 375 + 425 = 1000
*/
