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 →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data 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. Circles, Arrangements and Vectors
  2. /Mathematics
  3. /Counting Arrangements and Selections
Chapter 22 · Part 2 of 3Circles, Arrangements and Vectors
← Previous part: Circles on the Coordinate Plane and RadiansNext part: Vectors in Two Dimensions and Trigonometric Graphs →
High School (9–10)Algebra › Permutations and CombinationsFree course

Counting Arrangements and Selections

How many different PIN codes can a phone have, and how many teams can a coach pick from a squad?

  • Listing them would take all day, so we count with a rule.
  • You use factorials, count ordered arrangements with permutations, count unordered selections with combinations, and learn to tell which one a question needs.
  • Then you meet the usual conditions: two people who must sit together, a person who must be in the team, and equations in n.
  • It covers the matching unit of Cambridge IGCSE Additional Mathematics, and it also suits A-Level and IB.

3 lessons, about 1 h 15 min3 simulations10 problems3 practice questionsPython in every lesson

StemPy LabCreated by StemPy Lab

Free

Every lesson is open to read. Enroll to keep your place in the course. No payment needed.

This course includes

  • 3 lessons, about 1 h 15 min
  • 3 simulations with sliders
  • 3 practice questions with new numbers each time
  • 3 Python programs to run
  • 10 problems with worked solutions
  • 2 Python labs
1 question set
  • 1 revision note
  • 1 test
  • Log in to save

    Course outline (3 lessons)

    1. 1
      Lesson 1about 25 min

      Factorials and permutations

      When the order matters, the number of ways to fill places in a row is a product that shrinks by one each time. You use the multiplication rule and factorials, count arrangements of all the objects, count arrangements of some of them with the permutation formula, and use the rule on codes, numbers and queues.

      1 simulation1 practice question1 Python program3 problems1 Python lab
      Read the lesson
    2. 2
      Lesson 2about 25 min

      Combinations

      When the order does not matter, each group is counted several times by a permutation, so we divide. You use the combination formula, see why the numbers are symmetrical, choose from two groups, count a selection with at least one of something by subtraction, and count pairs and handshakes.

      1 simulation1 practice question1 Python program3 problems
      Read the lesson
    3. 3
      Lesson 3about 25 min

      Permutation or combination?

      The hardest step is to decide which count a question needs. You ask whether a different order gives a different result. You handle people who must sit together or must be chosen. You solve equations such as the number of permutations equal to 424242, and you learn what this unit leaves out.

      1 simulation1 practice question1 Python program4 problems1 Python lab1 question set1 note
      Read the lesson

    Test Your Learning

    Arrangements and Selections: Timed Test
    IGCSE format20 questions · 25 min
    Not started

    Your teacher

    StemPy LabStemPy Lab

    1 follower

    Loading…

    ← All Courses
    ← Circles on the Coordinate Plane and RadiansVectors in Two Dimensions and Trigonometric Graphs →
    More onAlgebra › Permutations and Combinations

    Discussion (0)

    Log in to join the discussion.

    Loading…