Hello. I have to prove the fallowing theorem:(adsbygoogle = window.adsbygoogle || []).push({});

"There is at least one prime number between n and n! (n factorial) for all n>2."

I would be happy if you could prove this theorem for me or at least tell me if you have used the rule of Infinity of Prime Numbers in your proof. Thank you.

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# How to prove this theorem

Loading...

**Physics Forums | Science Articles, Homework Help, Discussion**