Poirot1
- 243
- 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
gcd(x,y,z)=1
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.
PREREQUISITESMathematicians, educators, and students interested in number theory, particularly those studying Pythagorean triples and their properties.
I'm not sure how we "show" it, but here is a fact.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
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.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