How can we prove that a Pythagorean triple is primitive?

  • Context: MHB 
  • Thread starter Thread starter Poirot1
  • Start date Start date
  • Tags Tags
    Primitive
Click For Summary
SUMMARY

The discussion focuses on proving that the Pythagorean triple defined by the formula (a²-b², 2ab, a²+b²) is primitive, meaning that the greatest common divisor (gcd) of the triple is 1. It is established that for a Pythagorean triple to be primitive, the integers a and b must be coprime (gcd(a, b) = 1) and of opposite parity (one even, one odd). Additionally, a contradiction argument is suggested to explore common factors among the elements of the triple.

PREREQUISITES
  • Understanding of Pythagorean triples
  • Knowledge of gcd (greatest common divisor) and its properties
  • Familiarity with parity (even and odd integers)
  • Basic concepts of prime factorization
NEXT STEPS
  • Study the properties of Pythagorean triples in detail
  • Learn about the Euclidean algorithm for calculating gcd
  • Explore the implications of parity in number theory
  • Investigate contradiction arguments in mathematical proofs
USEFUL FOR

Mathematicians, educators, and students interested in number theory, particularly those studying Pythagorean triples and their properties.

Poirot1
Messages
243
Reaction score
0
I know that (a^2-b^2,2ab,a^2+b^2) is pythagorean triple. How to show it is primitive? i.e
gcd(x,y,z)=1
 
Mathematics news on Phys.org
Re: primitive pythagorean triple

Hello, Poirot!

I know that (x,y,z) = (a2 - b2, 2ab, a2 + b2) is a Pythagorean triple.

How to show it is primitive? .i.e. gcd(x,y,z) = 1
I'm not sure how we "show" it, but here is a fact.

For a primitive Pythagorean triple, a and b must be of opposite parity.
. . (One must be even, the other must be odd.)
 
Re: primitive pythagorean triple

Poirot said:
I know that (a^2-b^2,2ab,a^2+b^2) is pythagorean triple. How to show it is primitive? i.e
gcd(x,y,z)=1
The conditions for the triple to be primitive are that gcd(a,b)=1 and a, b are of opposite parity. See Pythagorean triple - Wikipedia, the free encyclopedia.
 
Re: primitive pythagorean triple

I'm pretty sure a contradiction argument is expedient.

assume x,y,z have a common factor d not equal to 1.
Since everything can be factorized into primes can I assume d is prime?
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
20
Views
4K
  • · Replies 24 ·
Replies
24
Views
1K
Replies
1
Views
2K
  • · Replies 37 ·
2
Replies
37
Views
5K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K