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. /Euler's totient two ways
MathematicsMediumHigh School (11–12)Number Theory

Euler's totient two ways

You will compute φ(n)\varphi(n)φ(n) twice: by counting, and by the product formula. Then you will test Euler's theorem on many cases.

The idea. Counting checks every kkk from 111 to nnn with gcd. The formula needs the primes of nnn: start with result = n and, for each prime ppp of nnn, subtract result // p.

Your tasks.

  1. Finish phi_count(n). Count the kkk from 111 to nnn with gcd(k, n) == 1.
  2. Finish phi_formula(n). Use the primes from primes_of(n) and the rule above.
  3. Finish euler_holds(a, n). Return True when aφ(n)≡1(modn)a^{\varphi(n)} \equiv 1 \pmod naφ(n)≡1(modn), using pow with three arguments.

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 up to 100100100 with phi_formula(n) == 24. How many are there?

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
← A solver for the Chinese remainder theoremOrders, primitive roots and Wilson →
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. A solver for the Chinese remainder theoremMedium
  5. Fast powers modulo mMedium
All labs on this topic →