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
  • Earth and Environmental Science
  • 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. /Counting by recursion
MathematicsMediumHigh School (11–12)Pigeonhole Principle, Recursion and Graph Theory

Counting by recursion

You will write three functions. Two count by a recurrence, and one counts by listing every case, so the checker can compare them.

The idea. The Tower of Hanoi needs hn=2hn−1+1h_n = 2h_{n-1} + 1hn​=2hn−1​+1 moves with h1=1h_1 = 1h1​=1. The staircase count is wn=wn−1+wn−2w_n = w_{n-1} + w_{n-2}wn​=wn−1​+wn−2​ with w1=1w_1 = 1w1​=1 and w2=2w_2 = 2w2​=2. Strings of 000 and 111 with no two 111s together can be counted by trying every string.

Your tasks.

  1. Finish hanoi(n). Use the recurrence, calling hanoi(n - 1).
  2. Finish stairs(n). Work forward in a loop with two variables.
  3. Finish no_two_ones(n). Loop over product("01", repeat=n) and count the strings that do not contain "11".

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, print stairs(n) and no_two_ones(n - 1) for a few values of nnn. What do you notice?

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
← Blocks and odd partsDerangements and Catalan numbers →
More onPigeonhole Principle, Recursion and Graph Theory

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Setting up a recurrenceRecurrences and Counting by Recursion

More labs on this topic

  1. Euler and two coloursMedium
  2. Degrees and componentsMedium
  3. Derangements and Catalan numbersMedium
  4. Blocks and odd partsMedium
  5. Boxes for remainders
Medium
All labs on this topic →