Interactive · 2 questions
There is a precise algorithm that has been defined to generate Pythagorean triples. This is called Euclid's formula and consists of three equations, , , and . Any values can be plugged in for m and n to get a Pythagorean triple. For example: Plugging in 5 for m and 2 for n gives us the triple (20, 21, 29).
Which values of m and n generate the triple (5,12,13)?
A triple where all three numbers are relatively prime is called a primitive Pythagorean triple. To generate a primitive Pythagorean triple, m and n must be relatively prime, and their difference must be odd.
This will be a bit more tricky...
How many Pythagorean triples include 12 as one of the leg lengths?
To solve this question, you must set one of the equations to 12. Since the question asks for 12 as a leg length, you can pick either or . Since 2mn is simpler, it would probably be better to choose this. If 2mn is equal to 12, m and n can be 3 and 2 or 6 and 1. This gives you the triples (5,12,13) and (12,35,37). Now you must remember that any triple with a 6, 3, 2, or 1 can be multiplied to give you a triple with a 12 in it. Setting these numbers as 2mn will give you the triple (3,4,5)/(6,8,10)/(12,16,20) as well.