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. /Division without the division keys
MathematicsEasyHigh School (11–12)Number Theory

Division without the division keys

You will write the division algorithm yourself, test divisibility, and list the remainders that squares can leave.

The idea. For b>0b > 0b>0 the quotient qqq is the number of times you can take bbb away from aaa before you go below 000. For a negative aaa you add bbb instead, until you reach 000 or more. The remainder is what is left, and 0≤r<b0 \le r < b0≤r<b.

Your tasks.

  1. Finish divide(a, b). Return the pair (q, r) with a == b * q + r and 0 <= r < b. Use a loop that adds or takes away b, not // or %.
  2. Finish divides(d, n). Return True when d divides n. You may use divide from task 1.
  3. Finish square_remainders(b). Return the sorted list of the different remainders of n * n on division by b, for n from 0 to b - 1.

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 square_remainders(16). Which remainders can a fourth power leave on division by 161616? Try it with n ** 4 instead of n * n.

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
← The Tower of Hanoi, move by movePrime factorisation 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 →