If p is prime, can (p-1)! ever be a multiple of p? After running several scenarios, I don't think that it can be, but I don't see a way to prove this. Can anyone offer a hint? I'm stuck!

Thanks.

Printable View

- Feb 28th 2012, 08:03 PMjoatmonPrime number proof
If p is prime, can (p-1)! ever be a multiple of p? After running several scenarios, I don't think that it can be, but I don't see a way to prove this. Can anyone offer a hint? I'm stuck!

Thanks. - Feb 29th 2012, 09:16 AMemakarovRe: Prime number proof
Use Euclid's lemma.

- Feb 29th 2012, 01:36 PMarlingtonbassettRe: Prime number proof
wilsons theorem may also help.

- Feb 29th 2012, 01:43 PMjoatmonRe: Prime number proof
Thanks for your help!