Quote:
Originally Posted by a1call
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.

Not what was claimed. I claimed your lower bound, is not the lowest without being prime it could go in some cases.