Solutions to Exercises in the Introduction of How To Prove It by Daniel J Velleman.
Problem (5): Use the table in Figure 1 and the discussion on Page 5 to find two more perfect numbers.
Euclid proved that if is a prime, then is a perfect number.
From the given table, we will take two numbers such that is a prime number: 5 and 7.
= 496, which is our first perfect number.
Similarly when n = 7, we get the next perfect number as 8128.