Results 1 to 2 of 2

Math Help - Prime Numbers Congruence

  1. #1
    Member
    Joined
    May 2006
    Posts
    148
    Thanks
    1

    Prime Numbers Congruence

    Theorem: If p is prime, and a + b = p - 1 for a, b positive integers, then a!*b! "is congruent to" (-1)^(b + 1) (mod p)

    a.) Illustrate two examples (w/ primes that are greater than 5) showing the theorem above.

    b.) Prove the above theorem.

    WORK:

    a.) Showing it:

    I'm assuming you pick a prime. So, let's pick 7 and 11.

    a + b = 7 - 1 = 6

    a!*b! "is congruent to" (-1)^(b + 1) (mod 7) ... not sure where to go from here.

    And similarly for 11:

    a + b = 11 - 1 = 10

    a!*b! "is congruent to" (-1)^(b + 1) (mod 11)

    And no clue how to do part b.

    Thanks!
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Global Moderator

    Joined
    Nov 2005
    From
    New York City
    Posts
    10,616
    Thanks
    10
    It reminds me of Gauss' Lemma. Here is the proof below.
    Attached Thumbnails Attached Thumbnails Prime Numbers Congruence-picture22.gif  
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. prime congruence help
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: November 14th 2011, 09:14 AM
  2. Replies: 1
    Last Post: October 22nd 2011, 01:37 PM
  3. Prime numbers and congruence equations.
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: November 22nd 2010, 12:54 AM
  4. Prime Power Congruence
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: April 24th 2009, 09:44 PM
  5. Prime Congruence
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: July 15th 2008, 03:06 PM

Search Tags


/mathhelpforum @mathhelpforum