Right Triangle and the Pythagorean Triple Formula

Click For Summary
SUMMARY

The discussion centers on the Pythagorean triple formula and its ability to generate all right triangles with whole number sides. The commonly referenced formulas, a=2mn, b=m²-n², and c=m²+n² for integers m>n>0, produce primitive triples and some non-primitive ones, but do not encompass all possible integer triplets. Notably, while (3,4,5) and (8,6,10) can be generated using these formulas, (9,12,15) cannot be represented as it fails to meet the criteria of being expressible as the sum of two squares. The extension of the formula to include a common factor k allows for the generation of all multiples of these triplets, ensuring comprehensive coverage of integer solutions.

PREREQUISITES
  • Understanding of Pythagorean theorem
  • Familiarity with integer properties and whole numbers
  • Knowledge of generating functions in number theory
  • Basic algebraic manipulation skills
NEXT STEPS
  • Research the derivation of Pythagorean triples using the formulas a=2mn, b=m²-n², c=m²+n²
  • Explore the concept of primitive vs. non-primitive Pythagorean triples
  • Investigate the conditions under which integers can be expressed as the sum of two squares
  • Learn about the implications of adding a common factor k to generate all multiples of Pythagorean triples
USEFUL FOR

Mathematicians, educators, students studying number theory, and anyone interested in the properties of right triangles and integer solutions.

e2m2a
Messages
354
Reaction score
13
Given: A right triangle and all the sides of the triangle are whole numbers. Does this imply that all the sides of the triangle can only be found by using the Pythagorean triple formula? Another words, is it possible that a right triangle can exist with whole number sides that escape the Pythagorean triple formula? Or put another way, does the Pythagorean triple formula capture every possible right trangle with whole number sides?
 
Mathematics news on Phys.org
What exactly do you call "Pythagorean triple formula"? There are multiple formulas that produce those triples.
 
Usual formulas: a=2mn,\ b=m^2-n^2,\ c=m^2+n^2 for integers m>n>0, give all possible integer triplets.
 
ok. That's what I wanted to know.
 
This formula does not give all possible triples. It gives all primitives and a bunch of the non primitives, right? If you add the multiples of those then you get all. But then they wouldn't be uniquely expressed (I guess..?).

Would it be relevant to find a formula which generates them all with only two variables..?
 
Good point. Some multiples are covered, some are not.

(3,4,5) is generated by n=1, m=2, and (8,6,10) is generated by n=1, m=3, but (9,12,15) is not covered as 15 cannot be written as the sum of two squares.

It is trivial to extend the formula to cover all multiples, just add a common factor k to all three lengths. Then you get some triplets with more than one set of integers, but you cover all triplets at least once.
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 18 ·
Replies
18
Views
3K