Quote:
Originally Posted by science_man_88
Depends on n if odd neither will n!(n+1) as it will be even. If n is 2 mod 3 then n+1 is 0 mod 3 and the result of subtracting it if n is more than 3 will be 0 mod 3.

Can you please provide an example for n, m where m is a prime number such that
n!n <= m < n! 1
Thanks in advance.