2 ms·
Your proof isn't quite correct: N!+1 could be divisible by some number larger than N. For example, if N=5, then N!+1=121, which is divisible by 11. You can sa
by jfengel 4y ago
Your proof isn't quite correct: N!+1 could be divisible by some number larger than N.
For example, if N=5, then N!+1=121, which is divisible by 11.
You can say that either N!+1 is prime or divisible by some prime larger than N. That means that there always exists some larger prime, but you haven't necessarily constructed it.
- eesmith 4y agoYes, I messed up. Thank you.