🗝️
A Top Edu Prep Story-Workbook

The Counting Kingdom

Somewhere between arithmetic and adventure lies a small kingdom where every choice — an outfit, a route, a team — hides a number waiting to be found. Five short chapters. Five counting powers. No math background required.

Author: Kim Minho Subject: Counting Principles Level: Beginner-friendly Chapters: 5 + Summary
🍎

1. The Rule of OR

Choosing from separate baskets

👗

2. The Rule of AND

Combining outfits, step by step

📚

3. Factorial Magic

Arranging every book on the shelf

🏅

4. Permutations

When the order wins the medal

🛡️

5. Combinations

Choosing a team, no order needed

🗺️

Kingdom Summary

The full map, at a glance

🍎 Chapter One

The Rule of OR

Addition Rule
🦊
Professor Vex explains

At the edge of the kingdom stands a fruit stall with two separate baskets — one of apples, one of oranges. You may take exactly one fruit, from either basket. Since the baskets never mix, every apple and every orange is a brand-new possibility. To count "either this OR that," we simply add.

The Idea, In Plain Words

If a task can be done in one way chosen from Group A, or in a completely separate way from Group B — and the two groups never overlap — then the total number of ways is just the two counts added together.

🍊 Example 1 — The Fruit Stall
A stall sells 3 kinds of apples or 2 kinds of oranges. You will buy exactly one piece of fruit. How many choices do you have?
Apples and oranges are separate groups — you pick one OR the other, never both at once. So we add: .
Answer: 5 ways
📖 Example 2 — The Library Cart
A library cart holds 4 fiction novels or 5 nonfiction books. You may borrow just one book. How many books could you choose?
Again, "fiction OR nonfiction" — the categories don't overlap, so add them: .
Answer: 9 ways
🚌 Example 3 — The Journey Home
To reach the castle, a traveler may take one of 2 bus routes or one of 3 subway routes. How many different single routes exist?
Bus routes and subway routes are separate options for the same trip — pick one path only, so we add: .
Answer: 5 ways
👗 Chapter Two

The Rule of AND

Multiplication Rule
🦊
Professor Vex explains

Now imagine getting dressed for the royal ball. First you choose a shirt. Then, no matter which shirt you picked, you still choose a pair of pants. Every single shirt can be paired with every single pair of pants — the choices happen together, in sequence. When a task needs step 1 and step 2 and more, we multiply the possibilities at each step.

The Idea, In Plain Words

If a task is completed through several independent steps, and step 1 can happen in a ways, step 2 in b ways, and so on — the total number of ways to complete all the steps together is the product of every step's count.

👕 Example 1 — Dressing for the Ball
You own 3 shirts and 4 pairs of pants. How many different shirt-and-pants outfits can you build?
Step 1 (shirt) has 3 options; step 2 (pants) has 4 options, and both steps happen together for one outfit. Multiply: .
Answer: 12 outfits
🍽️ Example 2 — The Feast Menu
A feast menu offers 3 main dishes, 2 drinks, and 2 desserts. If a guest picks exactly one of each, how many full meals are possible?
Three steps happen together — main and drink and dessert. Multiply all three counts: .
Answer: 12 meals
🔐 Example 3 — The Vault Code
A treasury vault uses a 3-digit code. Each digit can be any number from 0–9, and digits may repeat. How many codes are possible?
Each of the 3 positions is its own step with 10 options, and repeats are allowed, so nothing shrinks between steps: .
Answer: 1,000 codes
📚 Chapter Three

Factorial Magic

n! (n factorial)
🦊
Professor Vex explains

The royal librarian must line up 5 different books on a shelf, left to right. For the first spot, any of the 5 books will do. For the second spot, one book is already placed, so only 4 remain. And so on, until the very last book has no choice at all. This "countdown multiplication" happens so often that it earned its own symbol: ! — read as "factorial."

The Idea, In Plain Words

Factorial simply means: multiply every whole number from n down to 1. It counts the number of ways to arrange n distinct items in a straight line, using every item exactly once.

📚 Example 1 — Five Books, One Shelf
In how many orders can 5 different books be arranged on a shelf?
Spot 1 has 5 choices, spot 2 has 4 remaining, spot 3 has 3, spot 4 has 2, and the last spot has only 1 book left: .
Answer: 120 arrangements
🧑‍🤝‍🧑 Example 2 — The Portrait Line
4 knights are lining up for a portrait, standing shoulder to shoulder. How many different lineups are possible?
With 4 distinct knights filling 4 distinct spots, this is exactly a factorial: .
Answer: 24 lineups
🎻 Example 3 — Seven Musicians
A traveling band of 7 musicians takes turns performing solos, one after another, in some order. How many performance orders exist?
All 7 musicians perform, each in a distinct position: .
Answer: 5,040 orders
🏅 Chapter Four

Permutations

nPr — order matters
🦊
Professor Vex explains

The Kingdom Games have ended, and 5 runners crossed the line. We don't need to arrange all 5 — only the top 3 matter, for gold, silver, and bronze. Gold-then-silver is a completely different outcome from silver-then-gold. Choosing and arranging just a part of a group, where order changes the result, is called a permutation.

The Idea, In Plain Words

A permutation counts how many ways you can pick r items out of n and place them in order. It's a factorial that stops early — you only multiply the first r countdown steps, not all the way to 1.

🥇 Example 1 — Gold, Silver, Bronze
5 runners finish a race. In how many ways can gold, silver, and bronze medals be awarded to 3 of them?
Order matters (gold ≠ silver ≠ bronze), and we only fill 3 of the 5 spots: .
Answer: 60 ways
👑 Example 2 — King and Steward
From 6 nobles, one will be crowned king and a different one named royal steward. How many ways can these two distinct titles be assigned?
Two different roles from 6 people, order (who gets which title) matters: .
Answer: 30 ways
🎭 Example 3 — Casting Two Roles
A troupe of 7 actors auditions for 2 specific roles: the Hero and the Villain. How many different casting choices are there?
The Hero and Villain are distinct roles, so assigning actors to them is order-sensitive: .
Answer: 42 ways
💡
A quick note

Notice that when r equals n — arranging all the items — a permutation is exactly the same as a plain factorial: .

🛡️ Chapter Five

Combinations

nCr — order doesn't matter
🦊
Professor Vex explains

The castle needs 3 guards chosen from 5 volunteers to watch the gate tonight. Unlike the medal podium, there are no separate titles here — a guard is a guard. Choosing {Anna, Ben, Cora} is exactly the same team as choosing {Cora, Anna, Ben}. When order truly does not matter, we count combinations — and since a permutation counts every order separately, a combination simply removes the extra, repeated orderings.

The Idea, In Plain Words

A combination counts how many ways to choose a group of r items out of n, where the order inside the group makes no difference at all. We take the permutation count and divide out the ways the chosen group could have been ordered.

🛡️ Example 1 — Choosing the Night Guard
From 5 volunteers, a team of 3 guards will be chosen for gate duty (no ranks, just teammates). How many different teams are possible?
Order doesn't matter inside the team, so we divide the permutation by the ways to reorder 3 people: .
Answer: 10 possible teams
🎨 Example 2 — Picking Two Colors
A banner-maker has 6 colors of cloth and wants to pick any 2 to combine (the two chosen colors are simply used together — neither is "first"). How many 2-color combinations exist?
Since {red, blue} is the same pairing as {blue, red}, order doesn't count: .
Answer: 15 combinations
🍞 Example 3 — The Traveler's Basket
A merchant offers 7 kinds of bread. A traveler wants to buy any 3 different kinds to pack for a journey (just a basket, no ranking). How many possible baskets are there?
Choosing a set of 3 breads with no order: .
Answer: 35 baskets
🗺️ Final Chapter

The Kingdom Summary

Everything on one map
🦉
The Royal Owl's farewell

You've walked through five halls of the Counting Kingdom. Before you leave, here is the whole map — every rule, every formula, and the one question that tells you which path to take.

Which Rule Do I Use?

Are the choices happening as separate alternatives ("this OR that")?
→ Addition Rule: add the counts
Are the choices happening as sequential steps ("this AND that")?
→ Multiplication Rule: multiply the counts
Arranging ALL n distinct items in a line?
→ Factorial: n!
Choosing AND ordering only r out of n items?
→ Permutation: nPr
Choosing r out of n items where order makes no difference?
→ Combination: nCr

🍎 Addition Rule

Use for separate, non-overlapping choices — pick one path only.

👗 Multiplication Rule

Use for independent steps that all happen together.

📚 Factorial

Arranging every one of n distinct items, in a row.

🏅 Permutation

Choosing and ordering r items out of n — order matters.

🛡️ Combination

Choosing r items out of n — order does not matter.

🔑 The One Big Question

Does swapping the order create a new outcome?

Yes → Permutation / Factorial  |  No → Combination / Addition

RuleQuestion it answersOperationExample
AdditionOR — separate optionsAdd3 apples or 2 oranges = 5
MultiplicationAND — sequential stepsMultiply3 shirts × 4 pants = 12
FactorialArrange ALL n itemsn × (n−1) × … × 15! = 120
PermutationArrange r of n, order mattersn! / (n−r)!5P3 = 60
CombinationChoose r of n, order doesn't mattern! / (r!(n−r)!)5C3 = 10
🎓
Congratulations, traveler

You have completed the Counting Kingdom. Return to any chapter any time using the map on the left — and good luck on your next quest, wherever the numbers lead you.