WordGPT

Perfect numbers: 6, 28, 496, 8128

Exercise · Level 3 (Medium)

A number is perfect if it equals the sum of its proper divisors. Show that 28 is perfect and find the next one with Euclid's rule.

28=1+2+4+7+1428=1+2+4+7+14

wordgptpro.com

Solution

  1. The divisors of 28 smaller than 28 are 1, 2, 4, 7, 14, and

    1+2+4+7+14=281+2+4+7+14=28
    (1)
  2. Euclid's rule: when 2p−12^p-1 is prime, 2p−1(2p−1)2^{p-1}(2^p-1) is perfect.

    p=2: 2⋅3=6p=3: 4⋅7=28p=5: 16⋅31=496p=7: 64⋅127=8128\begin{aligned}p&=2:\ 2\cdot3\\&=6\qquad p\\&=3:\ 4\cdot7\\&=28\qquad p\\&=5:\ 16\cdot31\\&=496\qquad p\\&=7:\ 64\cdot127\\&=8128\end{aligned}
    (2)
  3. (Euler proved the converse for even numbers: all even perfect numbers have this form. It is unknown whether an odd perfect number exists.)

Answer28 is perfect; next: 49628\ \text{is perfect; next: } 496

wordgptpro.com

Need a hint?

Euclid: if 2ᵖ − 1 is prime, then 2ᵖ⁻¹·(2ᵖ − 1) is perfect. Try p = 2, 3, 5, 7.

28 = 1 + 2 + 4 + 7 + 14 is perfect; the next perfect numbers are 496 and 8128.

How to work it out

  1. The divisors of 28 smaller than 28 are 1, 2, 4, 7, 14, and

    1+2+4+7+14=281+2+4+7+14=28
    (1)
  2. Euclid's rule: when 2p−12^p-1 is prime, 2p−1(2p−1)2^{p-1}(2^p-1) is perfect.

    p=2: 2⋅3=6p=3: 4⋅7=28p=5: 16⋅31=496p=7: 64⋅127=8128\begin{aligned}p&=2:\ 2\cdot3\\&=6\qquad p\\&=3:\ 4\cdot7\\&=28\qquad p\\&=5:\ 16\cdot31\\&=496\qquad p\\&=7:\ 64\cdot127\\&=8128\end{aligned}
    (2)
  3. (Euler proved the converse for even numbers: all even perfect numbers have this form. It is unknown whether an odd perfect number exists.)

LaTeX source of the formulas on this page
\[ 28\ \text{is perfect; next: } 496 \]
\[ 1+2+4+7+14=28 \]
\[ p=2:\ 2\cdot3=6\qquad p=3:\ 4\cdot7=28\qquad p=5:\ 16\cdot31=496\qquad p=7:\ 64\cdot127=8128 \]

Questions

What is the answer to: Perfect numbers: 6, 28, 496, 8128?

28 = 1 + 2 + 4 + 7 + 14 is perfect; the next perfect numbers are 496 and 8128.

What is the key idea?

Perfect numbers come from Mersenne primes 2ᵖ − 1.

Is there a hint?

Euclid: if 2ᵖ − 1 is prime, then 2ᵖ⁻¹·(2ᵖ − 1) is perfect. Try p = 2, 3, 5, 7.

Related problems

More number theory problems

    Perfect numbers: 6, 28, 496, 8128: answer and solution | WordGPT