Results 1 to 2 of 2

Thread: Proof of primes

  1. March 10th 2010, 08:23 PM #1
    jzellt
    jzellt is offline
    Super Member
    Joined
    Feb 2008
    Posts
    535

    Proof of primes

    Show that if 2^n + 1 is a prime then n is a power of two.

    Show that if 2^n - 1 is a prime then n is also a prime.

    Please help...
    Follow Math Help Forum on Facebook and Google+
  2. March 10th 2010, 08:35 PM #2
    chiph588@
    chiph588@ is offline
    MHF Contributor chiph588@'s Avatar
    Joined
    Sep 2008
    From
    Champaign, Illinois
    Posts
    1,163
    Fermat number - Wikipedia, the free encyclopedia

    Mersenne prime - Wikipedia, the free encyclopedia
    Follow Math Help Forum on Facebook and Google+
« Quadratic residue -5 | Quadratic residue mod 32767 »

Similar Math Help Forum Discussions

  1. Mod proof with primes
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: February 1st 2010, 06:32 PM
  2. Proof of primes.
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: April 26th 2009, 12:12 AM
  3. proof of inifinite primes
    Posted in the Number Theory Forum
    Replies: 6
    Last Post: December 13th 2008, 01:10 AM
  4. Proof involving primes
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: March 14th 2008, 09:01 AM
  5. Primes proof
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: December 21st 2005, 06:13 AM

Search Tags


/mathhelpforum @mathhelpforum