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 revolves around how to demonstrate that a given Pythagorean triple, specifically of the form (a²-b², 2ab, a²+b²), is primitive, meaning that the greatest common divisor (gcd) of the three numbers is 1. Participants explore various conditions and methods for proving this property.
Participants generally agree on the conditions involving a and b for the triple to be primitive, but there is no consensus on the specific method to prove that gcd(x,y,z)=1.
Some assumptions regarding the properties of a and b, such as their parity and coprimality, are mentioned but not fully explored or proven within the discussion.
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