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. /Bases and squares
MathematicsEasyHigh School (11–12)Number Theory

Bases and squares

You will convert numbers to and from any base and test numbers for being squares, the slow way and the fast way.

The idea. The remainders of repeated division by bbb are the digits, units first. Going back, multiply by bbb and add the next digit. A square must leave 000 or 111 on division by 444, and 0,1,40, 1, 40,1,4 or 777 on division by 999, so these tests throw out most numbers quickly.

Your tasks.

  1. Finish to_base(n, b). Return the list of digits of n in base b, the first digit first. For n == 0 return [0].
  2. Finish from_base(digits, b). Return the number whose digits in base b are digits.
  3. Finish could_be_square(n). Return False when the remainder of n on division by 4 or by 9 rules out a square, and True otherwise.

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, count how many numbers from 111 to 100001000010000 pass could_be_square. What fraction of non-squares do the two tests catch?

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
← Legendre's formula by machineFast powers modulo m →
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 →