That's way over-kill.Bertrand's postulate, anyone?
are there prime factors of n! - 1 that is less than n?I considered Bertrand's Postulate but as hochs said it got messy.i still cant figure it out
Here's one way to think about it, kingtaf...That's way over-kill.
Just consider the prime factors of n! - 1, that's a one-line proof for this problem