Results 1 to 2 of 2

Thread: Divisibility

  1. March 26th 2010, 02:51 PM #1
    jgensler
    jgensler is offline
    Newbie
    Joined
    Mar 2010
    Posts
    3

    Divisibility

    So I have the following problem: Prove that if x is prime and n is not an integer multiple of x, then n^{x-1} \equiv 1 \mod{x}. I could really use some help getting this problem started and would appreciate a nudge in the correct direction. Thanks for any help.
    Follow Math Help Forum on Facebook and Google+
  2. March 26th 2010, 02:53 PM #2
    chiph588@
    chiph588@ is offline
    MHF Contributor chiph588@'s Avatar
    Joined
    Sep 2008
    From
    Champaign, Illinois
    Posts
    1,163
    Quote Originally Posted by jgensler View Post
    So I have the following problem: Prove that if x is prime and n is not an integer multiple of x, then n^{x-1} \equiv 1 \mod{x}. I could really use some help getting this problem started and would appreciate a nudge in the correct direction. Thanks for any help.
    Proofs of Fermat's little theorem - Wikipedia, the free encyclopedia
    Follow Math Help Forum on Facebook and Google+
« irreducibles | Remainders again »

Similar Math Help Forum Discussions

  1. Divisibility 11
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: December 20th 2008, 02:41 AM
  2. Divisibility (gcd) 10
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: December 19th 2008, 04:44 PM
  3. Divisibility (gcd) 9
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: December 19th 2008, 01:12 PM
  4. Divisibility (gcd) 8
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: December 19th 2008, 03:53 AM
  5. Divisibility
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: December 14th 2008, 09:24 AM

Search Tags


/mathhelpforum @mathhelpforum