Prove that if n>4 is composite, then n | (n-1)! Proof. Let n=ab, with p,q primes that divides a,b, respectively. Assume to the contrary that n do not divide (n-1)! Then n do not divided n-1, n-2, . . . , 1
Follow Math Help Forum on Facebook and Google+
Here.
View Tag Cloud