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. /Divisibility, value by value
MathematicsMediumHigh School (11–12)Mathematical Induction

Divisibility, value by value

You will study g(n)=n3+2ng(n) = n^3 + 2ng(n)=n3+2n. The claim is that 333 divides g(n)g(n)g(n) for every n≥1n \ge 1n≥1. You will collect evidence, find the largest common divisor of the values, and check the identity that the inductive step uses.

The idea. The step of the proof compares g(k+1)g(k + 1)g(k+1) with g(k)g(k)g(k). Here g(k+1)−g(k)=3k2+3k+3g(k + 1) - g(k) = 3k^2 + 3k + 3g(k+1)−g(k)=3k2+3k+3, which is clearly a multiple of 333. So if 3∣g(k)3 \mid g(k)3∣g(k), then 3∣g(k+1)3 \mid g(k + 1)3∣g(k+1).

Your tasks.

  1. Finish remainders(N). Return the list of g(n) % 3 for n from 1 to N.
  2. Finish common_divisor(N). Return the highest common factor of g(1), g(2), ..., g(N). Use gcd from the math module, starting from 0.
  3. Finish step_part(k). Return g(k + 1) - g(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, change g to n ** 3 + 5 * n. Is the largest common divisor still 333? Look at g(1)g(1)g(1) and g(2)g(2)g(2) first.

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
← Test a formula, then find where a pattern breaksWhere an inequality starts to hold →
More onMathematical Induction

Discussion (0)

Log in to join the discussion.

Loading…

More labs on this topic

  1. The Tower of Hanoi, move by moveMedium
  2. Matrix powers against a formulaMedium
  3. Fibonacci identities by computerMedium
  4. Where an inequality starts to holdMedium
  5. Test a formula, then find where a pattern breaksMedium
All labs on this topic →