Results 1 to 3 of 3

- December 1st 2007, 09:04 AM #1

- Joined
- Jan 2006
- Posts
- 56

## X+(0*0)=x

working on the famous diophantienne equation in mutualy prime numbers x^k+y^k=z^k I've been finding an interresting result for k = 2:

show that for such mutualy primes number x,y,z / x^2+y^2=z^2:

for the multiples existing positives integers k,c,d for wich:

k*x+1= abs(2x-z)*c and k*(z-x)+1= abs(2x-z)*d

we have abs (c*(z-x)+d*(z-(z+x)))= abs(c*(z-x)+d(-x))=1

(so z-x and x are prime! (wich is not the interesting part of all this stuff))

- December 1st 2007, 03:05 PM #2

- Joined
- Nov 2005
- From
- New York City
- Posts
- 10,616
- Thanks
- 10

- December 2nd 2007, 10:48 AM #3

- Joined
- Jan 2006
- Posts
- 56

i dont think the full solution in mutual prime numbers:

x=(m^2-n^2) y=2mn z=(m^2+n^2) whit m>n and m and n prime

would lead 'naturaly' to the solution of the assertion i propose

i let it unproved (for the moment) to excerce the sagacity of the readers who could be interested (and i must say i find my solution of this problem very interresting...)