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. /Legendre's formula by machine
MathematicsEasyHigh School (11–12)Number Theory

Legendre's formula by machine

You will count the power of a prime in n!n!n! without computing n!n!n!, count the zeros at its end, and find the first factorial with a given number of zeros.

The idea. Add ⌊n/p⌋\lfloor n/p \rfloor⌊n/p⌋, ⌊n/p2⌋\lfloor n/p^2 \rfloor⌊n/p2⌋, ... while the power of ppp is at most nnn. The zeros are the factors 555.

Your tasks.

  1. Finish legendre(n, p). Return the exponent of the prime p in n!.
  2. Finish zeros(n). Return the number of zeros at the end of n!.
  3. Finish first_with_zeros(z). Return the smallest n for which n! ends in exactly z zeros, or None if no factorial does. Search n from 0 to 5 * z + 5.

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, list every z from 0 to 50 for which first_with_zeros(z) is None. Where do the gaps sit?

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
← Counting and adding divisorsBases and squares →
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 →