Results 1 to 2 of 2

Math Help - How do you show that a Fermat number is not prime?

  1. #1
    Junior Member
    Joined
    Oct 2010
    Posts
    26

    How do you show that a Fermat number is not prime?

    I recently happened upon a problem that I cannot make any headway on. Here it is:

    Using the factorization of x^n+1 when n\geq 3 and is odd, show that 2^3^2+1 is not prime.

    I found this video, , that shows this, but, unfortunately, I don't think that it uses the factorization of x^n+1 when n\geq 3 and is odd and I don't know how to adapt it so that it does (if that is possible at all).

    Thank you. All help with this problem is appreciated.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Junior Member
    Joined
    Oct 2010
    Posts
    26
    Bump.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 1
    Last Post: September 29th 2011, 11:26 AM
  2. Replies: 0
    Last Post: September 24th 2011, 12:23 PM
  3. Replies: 4
    Last Post: December 13th 2009, 06:52 AM
  4. Replies: 0
    Last Post: December 11th 2009, 02:45 PM
  5. Replies: 3
    Last Post: November 13th 2006, 11:17 AM

Search Tags


/mathhelpforum @mathhelpforum