HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /A number is perfect when σ(n) = 2n. Prove that if 2ᵖ - 1 is prime, then 2ᵖ⁻¹(2ᵖ - 1) is perfect…
AdvancedMathematicsHigh School (11–12)Number TheoryConceptualNumericalOlympiad

A number is perfect when σ(n) = 2n. Prove that if 2ᵖ - 1 is prime, then 2ᵖ⁻¹(2ᵖ - 1) is perfect…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

A number is perfect when σ(n)=2n\sigma(n) = 2nσ(n)=2n.

  1. Prove that if 2p−12^p - 12p−1 is prime, then 2p−1(2p−1)2^{p-1}(2^p - 1)2p−1(2p−1) is perfect.
  1. Prove that no power of a prime, qkq^kqk with k≥1k \ge 1k≥1, is perfect. Show that σ(qk)<2qk\sigma(q^k) < 2q^kσ(qk)<2qk.
  1. The fourth perfect number is 8128=26(27−1)8128 = 2^6(2^7 - 1)8128=26(27−1). Find σ(8128)\sigma(8128)σ(8128) with the formula, as a check.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

For n=∏piain = \prod p_i^{a_i}n=∏piai​​: τ(n)=∏(ai+1)\tau(n) = \prod (a_i + 1)τ(n)=∏(ai​+1) and σ(n)=∏piai+1−1pi−1\sigma(n) = \prod \dfrac{p_i^{a_i + 1} - 1}{p_i - 1}σ(n)=∏pi​−1piai​+1​−1​. τ(n)\tau(n)τ(n) is odd exactly for squares. Even perfect numbers are 2p−1(2p−1)2^{p-1}(2^p - 1)2p−1(2p−1) with 2p−12^p - 12p−1 prime.

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Step 1. Part (a). Let Q=2p−1Q = 2^p - 1Q=2p−1, a prime. It is odd, so it is coprime to 2p−12^{p-1}2p−1. Then σ(2p−1Q)=σ(2p−1)σ(Q)=(2p−1)(Q+1)=Q⋅2p=2⋅2p−1Q\sigma(2^{p-1}Q) = \sigma(2^{p-1})\sigma(Q) = (2^p - 1)(Q + 1) = Q \cdot 2^p = 2 \cdot 2^{p-1}Qσ(2p−1Q)=σ(2p−1)σ(Q)=(2p−1)(Q+1)=Q⋅2p=2⋅2p−1Q. So the number is perfect.

Step 2. Part (b). σ(qk)=1+q+⋯+qk\sigma(q^k) = 1 + q + \dots + q^kσ(qk)=1+q+⋯+qk, so (q−1)σ(qk)=qk+1−1(q - 1)\sigma(q^k) = q^{k+1} - 1(q−1)σ(qk)=qk+1−1. We want σ(qk)<2qk\sigma(q^k) < 2q^kσ(qk)<2qk, that is, qk+1−1<2(q−1)qk=2qk+1−2qkq^{k+1} - 1 < 2(q - 1)q^k = 2q^{k+1} - 2q^kqk+1−1<2(q−1)qk=2qk+1−2qk. This is the same as 2qk−1<qk+12q^k - 1 < q^{k+1}2qk−1<qk+1. It holds because q≥2q \ge 2q≥2 gives qk+1≥2qk>2qk−1q^{k+1} \ge 2q^k > 2q^k - 1qk+1≥2qk>2qk−1. So σ(qk)<2qk\sigma(q^k) < 2q^kσ(qk)<2qk, and qkq^kqk is not perfect.

Step 3. Part (c). σ(8128)=σ(26)σ(127)=127×128=16256=2×8128\sigma(8128) = \sigma(2^6)\sigma(127) = 127 \times 128 = 16256 = 2 \times 8128σ(8128)=σ(26)σ(127)=127×128=16256=2×8128.

Answer: part (a) and part (b) are proved; σ(8128)=16256\sigma(8128) = 16256σ(8128)=16256. Proof complete.

What if? Numbers with σ(n)<2n\sigma(n) < 2nσ(n)<2n are called deficient, and those with σ(n)>2n\sigma(n) > 2nσ(n)>2n abundant. Part (b) shows that every prime power is deficient.

Log in to save this for later
← All Problems
← A school corridor has 1000 lockers, numbered 1 to 1000, all closed…A calculator shows only the first digits of a huge factorial, but you can still count the zeros at… →
More onNumber Theory

Discussion (0)

Log in to join the discussion.

Loading…

More on this topic

  1. The triangular numbers are 1, 3, 6, 10, …, where the nth one is (n(n + 1))/2…Advanced
  2. Prove that the equation x³ + y³ + z³ = n has no solution in integers when n leaves remainder 4 or 5…Advanced
  3. Find every triple of positive integers a ≤ b ≤ c with 1/a + 1/b + 1/c = 1, and prove that there are…Advanced
  4. Find all pairs of positive integers (x, y) with x² - y² = 945…Hard
  5. A teacher wants a list of every primitive Pythagorean triple whose hypotenuse is less than 100…Advanced
All problems on this topic →