Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

[((n-1)/2)!]^2 = -(-1)^[(n-1)/2] (mod n)

  1. Apr 5, 2008 #1

    xax

    User Avatar

    p is prime, not 2. Thanks in advance
     
  2. jcsd
  3. Apr 5, 2008 #2

    mathman

    User Avatar
    Science Advisor
    Gold Member

    There is no p in your expression!
     
  4. Apr 5, 2008 #3
    he had to have meant (mod p)
     
  5. Apr 6, 2008 #4

    xax

    User Avatar

    p = n
     
  6. Apr 6, 2008 #5
    This is not a difficult problem, but you must understand Wilson's Theorem. Wilson, by the way, was never a mathematician, and as a student went on to become a lawyer.

    He is credited with noticing the theorem, but was unable to prove it. So much for the immortal glory of a name theorem!
     
  7. Apr 6, 2008 #6

    :rofl:

    So what is your question and what have you tried to solve it?
     
  8. Apr 7, 2008 #7

    xax

    User Avatar

    I thought it was clear what the question was(since the others understood): prove that this is true for every n prime, n!= 2. Using the Wilson theorem, I didn't go far:
    ((n-1)/2)!*((n+1)/2)*((n+3)/2)*...*(n-1) = -1 (mod n).
     
  9. Apr 7, 2008 #8

    xax

    User Avatar

    Nevermind guys, I figured it out. Thanks for your input.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?



Similar Discussions: [((n-1)/2)!]^2 = -(-1)^[(n-1)/2] (mod n)
  1. 2^k + n (mod p) (Replies: 0)

  2. Embed Sn in A(n+2) (Replies: 2)

  3. Summation of n^2 (Replies: 5)

Loading...