If n is composite, n>4, prove that (n-1)!= 0 (mod n). = is congruent
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.
Separate names with a comma.