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. /Where an inequality starts to hold
MathematicsMediumHigh School (11–12)Mathematical Induction

Where an inequality starts to hold

You will write three functions that explore inequalities before you prove them. The first finds the point from which one quantity stays above another. The second measures how much room Bernoulli's inequality leaves.

The idea. "From n0n_0n0​ on" means: true at n0n_0n0​ and at every later nnn that we test. A single failure later resets the start. The base case of an induction proof is this n0n_0n0​.

Your tasks.

  1. Finish start_from(lhs, rhs, upto). Return the smallest n0 such that lhs(n) > rhs(n) for every n from n0 to upto.
  2. Finish bernoulli_gap(x, n). Return (1 + x) ** n - (1 + n * x).
  3. Finish bernoulli_holds(xs, upto). Return True when bernoulli_gap(x, n) >= 0 for every x in xs and every n from 1 to upto.

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, try bernoulli_holds([-4], 4). Why does it fail? Which condition on xxx does the proof need?

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
← Divisibility, value by valueFibonacci identities by computer →
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. Divisibility, value by valueMedium
  5. Test a formula, then find where a pattern breaksMedium
All labs on this topic →