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

Learning Paths

Each learning path is one chapter: a guided route through a topic, one small course at a time. Pick a class to see its chapters in order.

All CoursesLearning Paths
ChaptersStudent playlists

Mathematics · High School (11–12)

by StemPy Lab
Chapter 30
Pigeonhole, Recursion and Graph Theory
Pigeonhole Principle, Recursion and Graph Theory

Why must one of 12 boxes get two of 13 letters? Can every graph be drawn with no crossings?

  • The pigeonhole principle and how to choose boxes
  • Recurrences, derangements and Catalan numbers
  • Graphs, trees, Euler trails and colouring
3 courses
StemPy LabStemPy Lab