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. /Test a formula, then find where a pattern breaks
MathematicsMediumHigh School (11–12)Mathematical Induction

Test a formula, then find where a pattern breaks

You will write three small functions. The first two test the formula 1+3+⋯+(2n−1)=n21 + 3 + \dots + (2n - 1) = n^21+3+⋯+(2n−1)=n2 on many values. The third finds where the famous prime pattern n2−n+41n^2 - n + 41n2−n+41 stops working.

The idea. A computer can check thousands of cases quickly. That is strong evidence, and it is how a guess is found. It is still not a proof, because a pattern can break later.

Your tasks.

  1. Finish odd_sum(n). Return 1+3+5+⋯+(2n−1)1 + 3 + 5 + \dots + (2n - 1)1+3+5+⋯+(2n−1), adding the terms in a loop.
  2. Finish holds_up_to(N). Return True when odd_sum(n) == n * n for every n from 1 to N, and False otherwise.
  3. Finish first_composite(). Return the smallest n >= 1 for which is_prime(n * n - n + 41) is False.

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 414141 to 171717 in task 3. Where does the pattern n2−n+17n^2 - n + 17n2−n+17 break?

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
← Solving trigonometric equationsDivisibility, value by value →
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. Divisibility, value by valueMedium
All labs on this topic →