, prime odd number
Last edited by demdirbu; November 26th 2008 at 10:36 PM.
Follow Math Help Forum on Facebook and Google+
Originally Posted by demdirbu , prime odd number
Show that: This is a lightly disguised form of Fermat's theorem. Notice that . Modulo p, this is equivalent to . When you multiply this by k! you get (p-1)!.
View Tag Cloud