1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Problem ; modulo p

  1. Oct 13, 2012 #1
    if p is prime and n is natural number, show that (p-n+1) . (p-2)! + n–1 =0 (mod p)

    i think i have to show that (p-n+1) . (p-2)! = 0 (mod p) and n – 1 =0 (mod p)
    using Wilson theorem
    Last edited: Oct 13, 2012
  2. jcsd
  3. Oct 13, 2012 #2

    Well, of course [itex]\,n-1\neq 0\pmod p\,[/itex] almost always. Working modulo p in the following:

    $$(p-2)!=\frac{(p-1)!}{p-1}=\frac{-1}{-1}=1\Longrightarrow (p-n+1)(p-2)!+n-1=(-n+1)\cdot 1+n-1=-n+1+n-1=0$$

  4. Oct 13, 2012 #3
    thanks a lot.
    very clever.
    also i solve it inductances
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Similar Discussions: Problem ; modulo p
  1. Modulo Arithmatic (Replies: 2)

  2. Modulo arithmetic (Replies: 5)