Results 1 to 2 of 2

Math Help - Prime problem

  1. #1
    Super Member
    Joined
    Mar 2006
    Posts
    705
    Thanks
    2

    Prime problem

    Let p be prime with  p \equiv 1 (mod \ 4) Show that there are integers a,b for which  p=a^2 + b^2
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Global Moderator

    Joined
    Nov 2005
    From
    New York City
    Posts
    10,616
    Thanks
    9
    Quote Originally Posted by tttcomrader View Post
    Let p be prime with  p \equiv 1 (mod \ 4) Show that there are integers a,b for which  p=a^2 + b^2
    (This is Fermat's theorem. The elementary version (Fermat's) is much more difficult. It is amazing how simple arguments on unique factorization make theorems like this so simple).

    By the other arguments p is not irreducible. Thus, there exists a,b,c,d\in \mathbb{Z} such that p = (a+bi)(c+di) take the norm of both sides to get p^2 = (a^2+b^2)(c^2+d^2). Now work with unique factorization over \mathbb{Z}. It cannot be that one of those factors is 1 and the other p^2 because we cannot write 1=a^2+b^2 if a,b\not = 0. Thus, it means p=a^2+b^2=c^2+d^2. (In fact, a^2+b^2, and c^2+d^2 are exactly the same, i.e. there is also uniqueness involved but that is a different story).
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Birthday Problem; Prime Number Problem
    Posted in the Algebra Forum
    Replies: 9
    Last Post: January 8th 2012, 11:35 AM
  2. Replies: 1
    Last Post: October 22nd 2011, 12:37 PM
  3. prime problem
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: December 5th 2010, 03:53 AM
  4. Gcd/Prime Problem
    Posted in the Number Theory Forum
    Replies: 7
    Last Post: October 20th 2009, 06:01 AM
  5. relatively prime problem
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: April 30th 2009, 06:13 AM

Search Tags


/mathhelpforum @mathhelpforum