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. Python Labs
  2. /Counting and adding divisors
MathematicsEasyHigh School (11–12)Number Theory

Counting and adding divisors

You will list the divisors of a number, count them with the formula, add them, and test numbers for being perfect.

The idea. Divisors come in pairs ddd and n/dn / dn/d, so you only need to try ddd up to n\sqrt{n}n​. The formula τ(n)=∏(ai+1)\tau(n) = \prod (a_i + 1)τ(n)=∏(ai​+1) needs only the exponents of the factorisation.

Your tasks.

  1. Finish divisors(n). Return the sorted list of all positive divisors of n. Try only d with d * d <= n, and add both d and n // d.
  2. Finish tau_from_exponents(exponents). For a list of exponents such as [3, 2, 1], return the product of the numbers one more than each.
  3. Finish is_perfect(n). Return True when the sum of the divisors of n is 2 * n.

Run it first, just as it is. The checker at the end prints FAIL for each task. Then do the tasks one at a time, and run the program again after each one. A Hint appears under every check that still fails.

When every line says PASS, find all nnn below 100010001000 with exactly 101010 divisors. What shapes of factorisation do they have?

StemPy LabContributed by StemPy Lab
python
Loading Python runtime…

A worked solution

Run your code once to unlock the worked solution.

Have you tried it?

Do the tasks in the editor first, and run the checker after each one. Its hints help when a check fails. When you are ready, compare your code with this solution.

Log in to save
← All Labs
← Euclid and Bezout by machineLegendre's formula by machine →
More onNumber Theory

Discussion (0)

Log in to join the discussion.

Loading…

More labs on this topic

  1. Pythagorean triples by formula and by searchMedium
  2. Every solution of a linear equationMedium
  3. Orders, primitive roots and WilsonMedium
  4. Euler's totient two waysMedium
  5. A solver for the Chinese remainder theoremMedium
All labs on this topic →