I have a math problem:
we know , and .
may have value?
Follow Math Help Forum on Facebook and Google+
EDIT: whoops. sorry. gcd(x,y,z)=1 is given Oh well, looks like if you multply every thing out and use gcd[a(x,y,z)] you might get there.
Last edited by Hartlw; September 16th 2013 at 07:38 AM.
Did algebra and got as far as:
gcd(xz2+yx2+zy2, xy2+yz2+zx2, x+y+z)
Last edited by Hartlw; September 16th 2013 at 08:36 AM.
Thanks for the reply but I question the current, still do not know how to prove it. for numbers in the form 3n+1; 3k+1; 3m+1 we have gcd=3.
This is a problem in divisibility of polynomials. In the form of post #3, neither of the first two terms is divisible by x+y+z, gcd =1. Perlis has a nice chapter on this.
From Google: gcd(a,b,c) = gcd(gcd(a,b),c)
View Tag Cloud