4.4: Perfect, Mersenne, and Fermat Numbers
 Page ID
 8841
Integers with certain properties were studied extensively over the centuries. We present some examples of such integers and prove theorems related to these integers and their properties.
We start by defining perfect numbers.
A positive integer \(n\) is called a perfect number if \(\sigma(n)=2n\).
In other words, a perfect number is a positive integer which is the sum of its proper divisors.
The first perfect number is 6, since \(\sigma(6)=12\). You can also view this as \(6=1+2+3\). The second perfect number is 28, since \(\sigma(28)=56\) or \(28=1+2+4+7+14\).
The following theorem tells us which even positive integers are perfect.
The positive integer \(n\) is an even perfect number if and only if \[n=2^{l1}(2^l1),\] where \(l\) is an integer such that \(l\geq 2\) and \(2^l1\) is prime.
We show first that if \(n=2^{l1}(2^l1)\) where \(l\) is an integer such that \(l\geq 2\) and \(2^l1\) is prime then \(n\) is perfect. Notice that \(2^l1\) is odd and thus \((2^{l1},2^l1)=1\). Also, notice that \(\sigma\) is a multiplicative function and thus \[\sigma(n)=\sigma(2^{l1})\sigma(2^l1).\] Notice that \(\sigma(2^{l1})=2^l1\) and since \(2^l1\) is prime we get \(\sigma(2^l1)=2^l\). Thus \[\sigma(n)=2n.\] We now prove the converse. Suppose that \(n\) is a perfect number. Let \(n=2^rs\), where \(r\) and \(s\) are positive integers and \(s\) is odd. Since \((2^r,s)=1\), we get \[\sigma(n)=\sigma(2^r)\sigma(s)=(2^{r+1}1)\sigma(s).\] Since \(n\) is perfect, we get \[(2^{r+1}1)\sigma(s)=2^{r+1}s.\] Notice now that \((2^{r+1}1, 2^{r+1})=1\) and thus \(2^{r+1}\mid \sigma(s)\). Therefore there exists an integer \(q\) such that \(\sigma(s)=2^{r+1}q\). As a result, we have \[(2^{r+1}1)2^{r+1}q=2^{r+1}s\] and thus we get \[(2^{r+1}1)q=s\] So we get that \(q\mid s\). We add \(q\) to both sides of the above equation and we get \[s+q=(2^{r+1}1)q+q=2^{r+1}q=\sigma(s).\] We have to show now that \(q=1\). Notice that if \(q\neq 1\), then \(s\) will have three divisors and thus \(\sigma(s)\geq 1+s+q\). Hence \(q=1\) and as a result \(s=2^{r+1}1\). Also notice that \(\sigma(s)=s+1\). This shows that \(s\) is prime since the only divisors of \(s\) are \(1\) and \(s\). As a result, \[n=2^r(2^{r+1}1),\] where \((2^{r+1}1)\) is prime.
In theorem 50, we see that to determine even perfect numbers, we need to find primes of the form \(2^l1\). It is still unknown whether there are odd perfect numbers or not.
If \(2^l1\) is prime where \(l\) is a positive integer, then \(l\) must be prime.
Suppose that \(l\) is composite, that is \(l=rs\) where \(1<r<m\) and \(1<s<m\). Thus after factoring, we get that \[2^m1=(2^r1)(2^{r(s1)}+2^{r(s2)}+...+2^{r}+1)\] Notice that the two factors above are both greater than 1. Thus \(2^m1\) is not prime. This is a contradiction.
The above theorem motivates the definition of interesting numbers called Mersenne numbers.
Let \(l\) be a positive integer. An integer of the form \(M_l=2^l1\) is called the \(l\)th Mersenne number; if \(l\) is prime then \(M_l=2^l1\) is called the \(l\)th Mersenne prime.
\(M_3=2^31=7\) is the third Mersenne prime.
We prove a theorem that help decide whether Mersenne numbers are prime.
Divisors of \(M_p=2^p1\) for prime \(p\) is of the form \(2mp+1\), where \(m\) is a positive integer.
Let \(p_1\) be a prime dividing \(M_p=2^p1\). By Fermat’s theorem, we know that \(p_1\mid (2^{p_11}1)\). Also, it is easy to see that \[(2^{p}1,2^{p_11}1)=2^{(p,p_11)}1.\] Since \(p_1\) is a common divisor of \(2^p1\) and \(2^{p_11}1\) and thus not relatively prime. Hence \((p,p_11)=p\). Hence \(p\mid (p_11)\) and thus there exists a positive integer \(k\) such that \(p_11=kp\). Since \(p_1\) is odd, then \(k\) is even and thus \(k=2m\). Hence \[p_1=kp+1=2mp+1.\] Because any divisor of \(M_p\) is a product of prime divisors of \(M_p\), each prime divisor of \(M_p\) is of the form \(2mp+1\) and the result follows.
\(M_{23}=2^{23}1\) is divisible by \(47=46k+1\). We know this by trial and error and thus looking at all primes of the form \(46k+1\) that are less than \(\sqrt{M_{23}}\).
We now define Fermat numbers and prove some theorems about the properties of these numbers.
Integers of the form \(F_n=2^{2^n}+1\) are called Fermat numbers.
Fermat conjectured that these integers are primes but it turned out that this is not true. Notice that \(F_0=3\), \(F_1=5\), \(F_2=17\), \(F_3=257\) and \(F_4=65,537\) while \(F_5\) is composite. It turned out the \(F_5\) is divisible by \(641\). We now present a couple of theorems about the properties of these numbers.
For all positive integers \(n\), we have \[F_0F_1F_2...F_{n1}=F_n2\]
We will prove this theorem by induction. For \(n=1\), the above identity is true. Suppose now that \[F_0F_1F_2...F_{n1}=F_n2\] holds. We claim that \[F_0F_1F_2...F_{n}=F_{n+1}2.\] Notice that \[F_0F_1F_2...F_{n}=(F_n2)F_n=(2^{2^n}1)(2^{2^n}+1)=2^{2^{n+1}}1=F_{n+1}2.\]
Using Theorem 53, we prove that Fermat numbers are relatively prime.
Let \(s \neq t\) be nonnegative integers. Then \((F_s,F_t)=1\).
Assume without loss of generality that \(s<t\). Thus by Theorem 52, we have \[F_0F_1F_2...F_s...F_{t1}=F_t2\] Assume now that there is a common divisor \(d\) of \(F_s\) and \(F_t\). thus we see that \(d\) divides \[F_tF_0F_1F_2...F_s...F_{t1}=2.\] Thus \(d=1\) or \(d=2\). But since \(F_t\) is odd for all \(t\). We have \(d=1\). Thus \(F_s\) and \(F_t\) are relatively prime.
Exercises

Find the six smallest even perfect numbers.

Find the eighth perfect number.

Find a factor of \(2^{1001}1\).

We say \(n\) is abundant if \(\sigma(n)>2n\). Prove that if \(n=2^{m1}(2^m1)\) where \(m\) is a positive integer such that \(2^m1\) is composite, then \(n\) is abundant.

Show that there are infinitely many even abundant numbers.

Show that there are infinitely many odd abundant numbers.

Determine whether \(M_{11}\) is prime.

Determine whether \(M_{29}\) is prime.

Find all primes of the form \(2^{2^n}+5\) where \(n\) is a nonnegative integer.
Contributors
Dr. Wissam Raji, Ph.D., of the American University in Beirut. His work was selected by the Saylor Foundation’s Open Textbook Challenge for public release under a Creative Commons Attribution (CC BY) license.