Then I think maybe there is some problem with the method you suggested earlier?
The triple x+y,x-y,2z is not necessarily primitive, so I think we should use (i) rather than the theorem in my first post?
<=> x+y,x-y,2z is a Pythagorean triple (but it's not necessarily primitive)
where d is natural number, m and n are integers of opposite parity with m>n>0 and gcd(m,n)=1.
Now how can we characterize ALL solutions of ? Is there any restriction on "d"?
Thanks!
OK, since r and s are of opposite parity, must be odd, so is an integer if and only if d is EVEN. Also, if d is even, then this also guarantees that x and y are integers.
So I think the following characterizes ALL solutions of .
where d is any EVEN natural number, r and s are any integers of opposite parity with r>s>0 and gcd(r,s)=1?
Does this include ALL solutions?
Actually, still I think this answer is incomplete and we're MISSING some solutions. (since the problem was asking us to find ALL solutions of .)
For example, x=y=z=0 is a solution, but it's not included in the above formula. As another example, some x<0,y<0,z<0 can also be solutions of , but it's not included in the above formula as well. So we're definitely missing some solutions.
So how can we correctly and completely specify ALL solutions of ?
OK, now I've thought about it more, and I think that is even more serious problems. We're actually missing A LOT of solutions. For example, x=y=z is a solution for any integer (e.g. x=y=z=6 is a solution), but it's definitely not a Pythagorean triple, the formula above misses all of those. Also, all the negative solutions are missing from the above formula because by definition a Pythagorean triple is positive while solutions to the equation can be positive or negative.
So the above formula certainly does not include all solutions, how can we fix this problem? How can we correctly write down a formula that includes all the solutions?
Can someone kindly explain how we can summarize our final answer that includes all solutions into a compact formula?
Thanks a million!
OK, that works, so the solutions x=y=z are actually included in it.
We want to solve in the integers (rather than in the natural numbers), i.e. x,y,z E Z.
Integer solutions of : (?)
where d is any EVEN integer, r and s are any integers of opposite parity with r>s>0 and gcd(r,s)=1
(*)
(**)
Above we discussed the solutions of (*) in positive integers, and we observed that for any integer solution (x,y,z) to (**) the triple (x+y,x-y,2z) is an integer solution to (*). (When we say that x+y,x-y,2z is a Pythagorean triple, x+y,x-y, and 2z are assumed to be positive integers.) But it is not true that positive solutions to (**) correspond to positive solutions to (*) and vice versa. For example, if r=3, s=2, d=2, then x=17, y= -7, z=13, y is negative. So will our analysis above still give the correct formula for all integer solutions?
If we want to solve in in the integers, then how would you actually describe all the integer solutions? Does anyone happen to know the correct answer of this problem?
I am solving it in the integers, so the question should say:
Find all INTEGER solutions of .
Attempt:
<=>
<=>
x+y = +/-
x-y = +/-
2z = +/-
where d=0,2,4,6,...,
m and n are any integers of opposite parity with m>n>0 and gcd(m,n)=1
[I say +/- because x+y,x-y,2z may be a Pythagorean triple which requires x+y,x-y,2z to be positive, or some of x+y,x-y,2z may simply be the negatives of it]
<=>
x = +/-
y = +/-
z = +/-
where d=0,2,4,6,...,
m and n are any integers of opposite parity with m>n>0 and gcd(m,n)=1
<=>
x =
y =
z =
where d is any EVEN INTEGER, m and n are any integers of opposite parity with m>n>0 and gcd(m,n)=1
Is this the right way to analyze this problem? Is this the correct description of ALL (up to a reordering of x and y of course) integer solutions of ?? Did I miss any?
My textbook doesn't give the answer at the back, so there is no way for me to check my work. Can someone confirm that this is correct (or point out any mistake), please?
Thank you very much!