Results 1 to 2 of 2

Math Help - another congruence proof

  1. #1
    Junior Member
    Joined
    Feb 2009
    Posts
    29

    another congruence proof

    Need help with this again; I really need to go through congruences again.

    Let n be a composite integer > 4. Prove (n-1)! is congruent to 0mod n
    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 htata123 View Post
    Need help with this again; I really need to go through congruences again.

    Let n be a composite integer > 4. Prove (n-1)! is congruent to 0mod n
    See this.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. A Congruence Proof
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: April 22nd 2010, 03:50 PM
  2. Congruence proof
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: November 10th 2009, 11:03 AM
  3. A Congruence Proof
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: June 5th 2009, 10:34 AM
  4. Congruence proof
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: March 24th 2008, 08:16 AM
  5. Proof congruence
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: November 19th 2007, 10:13 AM

Search Tags


/mathhelpforum @mathhelpforum