Results 1 to 2 of 2

Thread: Help with number Theory HW

  1. #1
    Junior Member
    Joined
    Apr 2008
    From
    Gainesville
    Posts
    68

    Help with number Theory HW

    Let n be a positive integer with n not equal to 1. Prove that, if n^2+1 is prime number than n^2+1 is expressible in the form 4k + 1 with k an integer.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Global Moderator

    Joined
    Nov 2005
    From
    New York City
    Posts
    10,616
    Thanks
    10
    Quote Originally Posted by JCIR View Post
    Let n be a positive integer with n not equal to 1. Prove that, if n^2+1 is prime number than n^2+1 is expressible in the form 4k + 1 with k an integer.
    We can write $\displaystyle n$ in one of the forms: $\displaystyle 4k,4k+1,4k+2,4k+3$. The forms $\displaystyle 4k+1,4k+3$ do not give prime numbers when we compute $\displaystyle n^2+1$. Thus, $\displaystyle n=4k,4k+2$. In both these cases $\displaystyle n^2+1$ has form $\displaystyle 4k+1$.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Textbooks on Galois Theory and Algebraic Number Theory
    Posted in the Advanced Algebra Forum
    Replies: 3
    Last Post: Jul 8th 2011, 06:09 PM
  2. Number Theory
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: May 19th 2010, 07:51 PM
  3. Number Theory
    Posted in the Advanced Algebra Forum
    Replies: 4
    Last Post: Feb 16th 2010, 05:05 PM
  4. Replies: 2
    Last Post: Dec 18th 2008, 05:28 PM
  5. Number theory, prime number
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: Sep 17th 2006, 08:11 PM

Search Tags


/mathhelpforum @mathhelpforum