Originally Posted by

**DiscreteW** Prove:

For all pos. integers $\displaystyle n$, if sum of divisors of $\displaystyle n$ is $\displaystyle n+1$, then $\displaystyle n$ is prime.

Apparently this is famous. This is an intro course though and the proofs I found tend to be complicated. Prove it by contrapositive? Or contradiction?

Anyone know how to prove it?

The proof I found is: the sum of divisors is at least $\displaystyle n+1$ since $\displaystyle 1$ and $\displaystyle n$ divide $\displaystyle n$. If it's $\displaystyle n+1$, we then know there are no other divisors. Thus, $\displaystyle n$ is prime.

How do we know there are no other divisors?