Results 1 to 3 of 3

Math Help - Prime number Proof

  1. #1
    Newbie
    Joined
    Oct 2009
    Posts
    24

    Prime number Proof

    If p is prime, prove that for any integer a, p divides a^p + (p-1)!a and p divides (p-1)!a^p + a
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member
    Joined
    Nov 2009
    Posts
    277
    Thanks
    2

    wilson's theorem

    For a prime p Wilson's theorem says that (p-1)! = -1 mod p.

    Also, Fermat's little theorem says that for a s.t. (a,p) = 1 (no common factor), a^(p-1) = 1 (p), which implies that a^p = a (p).

    Try these in your problem.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    MHF Contributor chiph588@'s Avatar
    Joined
    Sep 2008
    From
    Champaign, Illinois
    Posts
    1,163
    Note that  a^p \equiv a \mod{p} \; \forall a though.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Prime number proof
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: February 29th 2012, 01:43 PM
  2. [SOLVED] Prime number proof
    Posted in the Math Topics Forum
    Replies: 2
    Last Post: May 22nd 2009, 08:16 PM
  3. Proof of Prime number
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: April 23rd 2009, 04:19 AM
  4. Prime Number Proof
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: March 16th 2009, 11:32 PM
  5. Prime Number Proof
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: October 9th 2008, 12:22 PM

Search Tags


/mathhelpforum @mathhelpforum