Loading ...
Sorry, an error occurred while loading the content.

19547Diophantine Pythagorean theorem

Expand Messages
  • Sebastian Martin
    Aug 25, 2008
    • 0 Attachment
      Diophantine Pythagorean theorem.
      Prove this Theorem:
      “ If p is a prime number then the following Diophantic Equation
      has only one solution. (p, k ,q) integers.
      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

      [Non-text portions of this message have been removed]