Browse Groups

• ## Diophantine Pythagorean theorem CORRECT

(1)
• NextPrevious
• Hello all Diophantine Pythagorean theorem.   Prove this Theorem:   “ If p is a ODD prime number then the following Diophantic Equation   p^2+(p+k)^2=q^2
Message 1 of 1 , Aug 25, 2008
View Source
Hello all

Diophantine Pythagorean theorem.

Prove this Theorem:

 If p is a ODD prime number then the following Diophantic Equation

p^2+(p+k)^2=q^2

has only one solution. (p, k ,q) integers.

k=((p-2)*p-1)

q=(p^2+1)/2  

Countraexample for the composite case:

p=9       9^2 +(9+3)^2=15^2           (9,3,15)

9^2+(9+31)^2=41^2         (9,31,41)

Sebastián Martin Ruiz

__________________________________________________
Correo Yahoo!
Espacio para todos tus mensajes, antivirus y antispam ¡gratis!
Regístrate ya - http://correo.yahoo.es

__________________________________________________
Correo Yahoo!
Espacio para todos tus mensajes, antivirus y antispam ¡gratis!
Regístrate ya - http://correo.yahoo.es

[Non-text portions of this message have been removed]
Your message has been successfully submitted and would be delivered to recipients shortly.
• Changes have not been saved
Press OK to abandon changes or Cancel to continue editing
• Your browser is not supported
Kindly note that Groups does not support 7.0 or earlier versions of Internet Explorer. We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox. If you are using IE 9 or later, make sure you turn off Compatibility View.