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

Counting Principles: Permutations and Combinations

A High School and Early College Primer

Permutations and combinations trip up more students than almost any other topic — not because the ideas are deep, but because the problems all look similar until you know what to look for. One wrong choice between ordered and unordered arrangements and the entire answer collapses.

This TLDR guide cuts straight to what matters. In about fifteen focused pages, you will get the multiplication and addition counting principles, the full derivation of permutation and combination formulas, worked examples with real numbers, and a reliable decision process for telling the two apart under exam pressure. Trickier cases — repeated elements, circular arrangements, Pascal's triangle, and the connection to basic probability — are covered in plain language with no hand-waving.

This is the right book if you are preparing for the SAT, ACT, or an AP course that touches discrete math or probability; if you are in a first-semester college math or statistics course that assumes you already know this material (and you don't, quite); or if you are a parent or tutor who needs a clean, fast-moving explanation to share.

The guide is short on purpose. There is no filler, no re-explaining things you already know, and no padding. Every section earns its place. If you have searched for a permutations and combinations study guide that respects your time, this is it.

Pick it up and walk into your next exam knowing exactly which formula to reach for.

What you'll learn
  • Apply the multiplication and addition principles to break counting problems into stages
  • Compute permutations of distinct and repeated objects, including circular arrangements
  • Compute combinations and recognize when order matters versus when it doesn't
  • Distinguish permutations from combinations in word problems and avoid common double-counting errors
  • Use counting techniques to solve probability problems and recognize Pascal's triangle and the binomial coefficient
What's inside
  1. 1. Why Counting Is Harder Than It Looks
    Orients the reader to what counting problems are, why they show up everywhere, and the two foundational rules: the multiplication and addition principles.
  2. 2. Permutations: When Order Matters
    Defines permutations, derives the formula using factorials, and works through arrangements of all or some of a set of distinct objects.
  3. 3. Permutations With Repetition and Circular Arrangements
    Handles the trickier permutation cases: identical objects (like letters in MISSISSIPPI) and arrangements around a circle.
  4. 4. Combinations: When Order Doesn't Matter
    Introduces combinations, derives C(n,k) from P(n,k), and shows how to recognize 'order doesn't matter' in word problems.
  5. 5. Telling Permutations and Combinations Apart
    Walks through mixed problems where students commonly confuse the two, and teaches a decision process plus how to combine counts using the multiplication and addition principles.
  6. 6. Where This Shows Up: Probability, Pascal's Triangle, and Beyond
    Connects counting to probability calculations, the binomial theorem, Pascal's triangle, and previews where these tools appear in later courses.
Published by Solid State Press
Counting Principles: Permutations and Combinations cover
TLDR STUDY GUIDES

Counting Principles: Permutations and Combinations

A High School and Early College Primer
Solid State Press

Counting Principles: Permutations and Combinations

A High School and Early College 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.

Who This Book Is For

If you're a high school student working through discrete math counting methods, prepping for the AP Statistics exam, or grinding through SAT math counting problems before test day, this book was written for you. It also works for a college freshman who needs a fast, honest reset before a probability or combinatorics unit.

This permutations and combinations study guide covers the multiplication rule, factorial notation, and permutation formulas before moving to combinations and the critical skill of knowing which tool to reach for. Think of it as a combinations vs. permutations explained simply — no bloated textbook detours, just the core ideas with worked numbers. The intro to probability counting techniques in the final section show you exactly where this math lands in the real world. About 15 pages, zero filler.

Read straight through — the sections build on each other. Work every example before you read the solution, then use the problem set at the end to find out what actually stuck.

Contents

  1. 1 Why Counting Is Harder Than It Looks
  2. 2 Permutations: When Order Matters
  3. 3 Permutations With Repetition and Circular Arrangements
  4. 4 Combinations: When Order Doesn't Matter
  5. 5 Telling Permutations and Combinations Apart
  6. 6 Where This Shows Up: Probability, Pascal's Triangle, and Beyond
Chapter 1

Why Counting Is Harder Than It Looks

Suppose you're creating a password: four letters followed by two digits. How many possible passwords are there? Most people guess a few hundred, maybe a few thousand. The real answer is 26 × 26 × 26 × 26 × 10 × 10 = 45,697,600. That gap between instinct and reality is exactly why counting gets its own branch of mathematics.

A counting problem asks: how many ways can something happen? Not whether it happens, not how likely it is — just how many distinct outcomes exist. These problems show up in probability (you need to count outcomes before you can find a chance), in computer science (how many inputs does an algorithm handle?), in scheduling, genetics, game design, and standardized tests. The AP Statistics and SAT math sections both include them. So does almost every college discrete math or probability course.

The obstacle is that human intuition about large numbers is poor. We undercount because we forget that early choices multiply the options downstream. We overcount because we don't notice when two arrangements are actually the same thing. The tools in this book fix both errors with a systematic approach.

The Multiplication Principle

The single most useful idea in all of counting is this: if a task has multiple independent stages, multiply the number of options at each stage.

This is called the multiplication principle (sometimes the fundamental counting principle). It works whenever completing the full task means doing Stage 1 and Stage 2 and Stage 3, and so on — each stage is a separate, independent choice.

Example. A diner offers 3 soups, 5 sandwiches, and 2 drinks. How many different lunch combinations (one of each) are possible?

Solution. There are three stages: pick a soup, pick a sandwich, pick a drink. The choices are independent — whichever soup you pick, all 5 sandwiches are still available. Multiply: $3 \times 5 \times 2 = 30$ combinations.

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