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. /Blocks and odd parts
MathematicsMediumHigh School (11–12)Pigeonhole Principle, Recursion and Graph Theory

Blocks and odd parts

You will write three functions for the number pigeonholes of this lesson: prefix sums, a block with a sum divisible by the length of the list, and the odd part of a number.

The idea. The prefix sums of a list of mmm numbers are S0=0,S1,…,SmS_0 = 0, S_1, \dots, S_mS0​=0,S1​,…,Sm​. Two of them share a remainder on division by mmm, and the numbers between them form the block. The odd part of a number is what is left after dividing out every factor 222.

Your tasks.

  1. Finish prefix_sums(numbers). Return the list [S0,S1,…,Sm][S_0, S_1, \dots, S_m][S0​,S1​,…,Sm​], starting with 0.
  2. Finish divisible_block(numbers). Return a pair (i, j) with i < j such that sum(numbers[i:j]) is divisible by len(numbers).
  3. Finish odd_part(n). Divide n by 2 while it is even, and return what is left.

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, test divisible_block on a list of your own of length 888. Add up the block it returns and divide by 888.

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
← Boxes for remaindersCounting by recursion →
More onPigeonhole Principle, Recursion and Graph Theory

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Pigeonholes in numbers and geometryThe Pigeonhole Principle

More labs on this topic

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