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. /Prime factorisation machine
MathematicsEasyHigh School (11–12)Number Theory

Prime factorisation machine

You will write a prime test, a factorisation into a dictionary of exponents, and a test for perfect powers that reads the exponents.

The idea. A composite number has a prime factor at most its square root. Divide out each factor as many times as it goes, and count. A number is a perfect kkkth power exactly when every exponent is a multiple of kkk.

Your tasks.

  1. Finish is_prime(n). Return True for a prime and False otherwise. Try the divisors d with d * d <= n. Remember that 111 is not prime.
  2. Finish factorise(n). Return a dictionary such as {2: 3, 3: 2, 5: 1} for 360360360.
  3. Finish is_perfect_power(n, k). Return True when every exponent of factorise(n) is a multiple of k.

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, print factorise(n * n + n + 41) for n from 38 to 42. Which values are prime, and which are not?

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
← Division without the division keysEuclid and Bezout 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 →