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

Help for another trouble

  1. Oct 14, 2007 #1
    If n is composite, n>4, prove that (n-1)!= 0 (mod n). = is congruent
     
  2. jcsd
  3. Oct 14, 2007 #2
    Let n=(n-i)(n-j). If i is not equal to j then both terms will appear in the expansion of (n-1)!. You can probably handle the case i=j yourself with a little thought.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?



Similar Discussions: Help for another trouble
  1. Another Proof (Replies: 2)

Loading...