SOLID STATE PRESS
← Back to catalog
Permutations and Combinations cover
Coming soon
Coming soon to Amazon
This title is in our publishing queue.
Browse available titles
Mathematics

Permutations and Combinations

Multiplication, Permutations, and Combinations Explained — A TLDR Primer

Permutations and combinations show up on nearly every algebra II, precalculus, discrete math, and intro probability exam — and most students hit a wall the moment a problem asks "does order matter?" This guide exists to knock that wall down.

**TLDR: Permutations and Combinations** covers every core counting technique with no filler: the multiplication and addition principles, factorials, full and partial permutations, repeated-element arrangements, combinations, complementary counting, and the classic traps that cost students points. Each idea is built from a worked example before the formula appears, so the algebra always has something concrete to hang on.

This is a high school math counting techniques book written for students in grades 9–12 and early college who need to understand the material quickly and cleanly — not wade through a 400-page textbook. It is also useful for parents helping their kids prep for an exam and for tutors who want a crisp, example-dense session resource.

The final section connects counting to probability and computer science, so you understand why this toolkit matters beyond a single unit test. If you are working through combinations and permutations for algebra 2 or preparing for a discrete math or statistics course, this guide gives you the orientation, the formulas, and the practice you need in one short read.

Pick it up, read it once, and walk into your exam ready.

What you'll learn
  • Apply the multiplication and addition principles to break counting problems into stages
  • Distinguish when order matters (permutations) from when it doesn't (combinations) and choose the right formula
  • Compute permutations and combinations using factorials, including with repeated objects
  • Recognize and avoid common pitfalls like double-counting and miscounting cases with restrictions
  • Use counting techniques to set up basic probability problems
What's inside
  1. 1. What Counting Really Means
    Introduces the goal of combinatorics and the central question 'order or not?' that drives every problem.
  2. 2. The Multiplication and Addition Principles
    Builds the two foundational rules for combining choices, with worked examples like license plates and menu options.
  3. 3. Permutations: When Order Matters
    Develops the permutation formula, including arrangements of all n objects, partial arrangements P(n,k), and permutations with repeated objects.
  4. 4. Combinations: When Order Doesn't Matter
    Introduces C(n,k), explains why we divide by k!, and contrasts combinations with permutations through paired examples.
  5. 5. Tricky Cases: Restrictions, Repetition, and Double-Counting
    Tackles the harder problems students actually see: restricted seating, identical items, complementary counting, and avoiding double-counting.
  6. 6. Why It Matters: Counting in Probability and Beyond
    Connects counting to probability, poker hands, and computer science applications so students see why these tools are worth mastering.
Published by Solid State Press
Permutations and Combinations cover
TLDR STUDY GUIDES

Permutations and Combinations

Multiplication, Permutations, and Combinations Explained — A TLDR Primer
Solid State Press

Permutations and Combinations

Multiplication, Permutations, and Combinations Explained — A TLDR Primer

Copyright © 2026 Solid State Press.

Published by Solid State Press.

All rights reserved. No part of this book may be reproduced or transmitted in any form without prior written permission, except for brief quotations in critical reviews and educational use.

Part of the TLDR Study Guides series.

Contents

  1. 1 What Counting Really Means
  2. 2 The Multiplication and Addition Principles
  3. 3 Permutations: When Order Matters
  4. 4 Combinations: When Order Doesn't Matter
  5. 5 Tricky Cases: Restrictions, Repetition, and Double-Counting
  6. 6 Why It Matters: Counting in Probability and Beyond
Chapter 1

What Counting Really Means

Suppose you have three friends — Asha, Ben, and Carlos — and you want to know how many ways they can stand in a line for a photo. You could list every possibility: ABC, ACB, BAC, BCA, CAB, CBA. That's six arrangements. Now ask a different question: how many ways can you choose two of the three to be in the photo at all, without caring who stands where? Suddenly the answer shrinks — there are only three such pairs. Same three people, two different questions, two different answers.

That gap — six versus three — is the heart of combinatorics, the branch of mathematics devoted to counting arrangements, selections, and groupings. Combinatorics doesn't ask what the objects are; it asks how many ways something can be done.

The central question every problem asks

Before you calculate anything, you need to answer one question: does order matter?

When order matters, you're counting arrangements — sequences where position is meaningful. ABC and BAC are different outcomes because the order of people differs. When order doesn't matter, you're counting selections — groups where position is irrelevant. {Asha, Ben} and {Ben, Asha} are the same pair.

This single distinction — ordered versus unordered — determines which formula you reach for every time. Almost every mistake students make in counting comes from answering this question wrong. Before you do any computation at all, ask yourself: if I swap two items, do I get a genuinely new outcome, or the same one?

Listing is fine — until it isn't

With three people, listing all six arrangements is easy. With ten people, you'd need to list 3,628,800 arrangements. That number isn't a typo, and you'd have given up long before you finished. This is why formulas exist: to give you the count without forcing you to enumerate every case.

About This Book

If you are a high school student who needs combinations and permutations algebra 2 help, a precalculus student staring down a unit on probability counting methods, or a college freshman taking discrete math with no prior background, this book is for you. It also works for anyone helping a student prep — tutors, parents, anyone who needs a fast, honest review.

This permutations and combinations study guide covers every core idea: the multiplication and addition principles, factorial notation, how to count arrangements and selections, and when to use each formula. It is also a practical discrete math primer for beginners who need the intro probability counting rules explained without jargon. A concise overview with no filler.

Start at page one and read straight through. Every section is a high school math counting techniques book in miniature: definition, worked example, common mistake called out. When you finish, hit the problem set at the end to confirm the ideas have stuck.

Keep reading

You've read the first half of Chapter 1. The complete book covers 6 chapters in roughly fifteen pages — readable in one sitting.

Coming soon to Amazon