The set of three integer values for the lengths of the sides of a right triangle is called a Pythagorean triple. These three sides must satisfy the relationship that the sum of the two sides is equal to the square of the hypotenuse. Find all integer Pythagorean triples for side1, side2, and the hypotenuse, all no larger than 500. Use a triple-nested for loop that tries all possibilities. This program is an example of brute force computing. You will learn in more advanced computer science courses that there are many interesting problems for which there is no algorithmic approach other than using sheer brute force. This program does not need any input from the user. Write at least one bool function that takes the 3 sides of the triangle and returns true or false based on if it is a right triangle or not.

Question

Computers and Technology

Diego Reyes

22 April, 03:55

The set of three integer values for the lengths of the sides of a right triangle is called a Pythagorean triple. These three sides must satisfy the relationship that the sum of the two sides is equal to the square of the hypotenuse. Find all integer Pythagorean triples for side1, side2, and the hypotenuse, all no larger than 500. Use a triple-nested for loop that tries all possibilities. This program is an example of brute force computing. You will learn in more advanced computer science courses that there are many interesting problems for which there is no algorithmic approach other than using sheer brute force. This program does not need any input from the user. Write at least one bool function that takes the 3 sides of the triangle and returns true or false based on if it is a right triangle or not.

+5

Answers (1)

Know the Answer?

Jazlynn Bryant · Answer 1

The solution code is written in C++

#include using namespace std; bool checkTriangle (int s1, int s2, int h) { if ((s1*s1 + s2*s2) = = h*h) { return true; }else{ return false; } } int main () { int i, j, k; for (int i=1; i <=500; i++) { for (int j = 1; j < = 500; j++) { for (int h = 1; h <=500; h++) { if (checkTriangle (i, j, h)) { cout<<"Side 1: "<
Explanation:

Firstly, we write a function checkTriangle with three input parameters, s1, s2 and h (Line 5-12). This function will evaluate the input s1, s2 and h to check if their relationship follow the Pythagorean triple. If so, it will return true, if not, it return false.

Once the function is ready, we can create a triple-nested loop to try all possible value of side1, side2 and hypotenuse below or equal to 500 and call the checkTriangle function to examine if any combination of the values follow the Pythagorean triple relationship. If true, print the sides and hypothenus (Line 18 - 27).