6

For $n > 1$, show that every prime divisor of $n! + 1$ is an odd integer that is greater than $n$.

If $n > 1$, then $n! = n(n-1)(n-2) \cdots 3\cdot2\cdot1 = 2[n(n-1)(n-2) \cdots 3\cdot1]$ is even. So $n! + 1$ is odd. Does this mean every divisor of $n! + 1$ is odd? It's not like an even divisor can divide an odd number anyways.

Bill Dubuque
  • 282,220
user281005
  • 69

3 Answers3

13

Let $p$ a prime divisor of $n! + 1$. If $p \leqslant n$, then $p$ divides $n!$, thus it divides $(n!+1) - n! = 1$, which is impossible. We conclude that every prime divisor of $n! + 1$ is greater than $n$.

Éric Guirbal
  • 1,288
  • But how do I show that the prime divisior of n!+1 is odd? – user281005 Oct 16 '15 at 18:49
  • @user281005 The argument that even number can't divide odd number (which you use in question's body) is valid. – Wojowu Oct 16 '15 at 18:49
  • 6
    Every prime divisor of $n!+1$ is greater than $n$, since $n\gt1$, any prime divisor must be greater than $2$. All primes greater than $2$ are odd. – robjohn Oct 16 '15 at 18:54
1

Observe that for $n > 1$, $n!$ is clearly even by definition of factorial and so $n! + 1$ is therefore odd. Since $n! +1$ is odd, all of its prime divisors are odd also.

Oiler
  • 3,491
1

$$n! = 1\cdot2\cdot3\cdot4\cdots n.$$ The number above has lots of even divisors. It is therefore an even number (unless $n=0$ or $1$). Consequently when you add $1$ to it, you get an odd number. Every divisor of an odd number is odd. So $n!+1$ has no even divisors.

Michael Hardy
  • 1