Chapter 2 — Tally and the Stacking-Cubes

Tally is a small squirrel-tween with a small pouch of stacking-cubes and a quick, calculating bearing.

She is small, warm-russet-and-cream, quick-eyed, fond-of-stacking-towers. Her signature feature is the pouch of small wooden stacking-cubes — each cube one of several colors. She physically stacks them in arrangements to demonstrate counting: 3 cubes stacked many different ways shows how many arrangements (permutations) are possible.

This is load-bearing. Tally embodies combinatorics — the discrete-math primitive of counting arrangements without listing each one. Her behavior IS the discrete pattern — building a small stack of cubes to represent each arrangement.

(Soft collisions: DiscreteQuest Tally ≠ CountingPals Tappa (her old name was Counta — replaced) / CipherForge Tally (number-codes) / EscapeForge Tally (math puzzles). Different domains per registry rule 3.)

The multiplication rule: if you have A choices for the first step and B choices for the second step, you have A × B total arrangements. Tally demonstrates: 3 shirts, 4 pants = 3 × 4 = 12 outfit-combinations. You don’t have to list all 12; you just multiply.

Permutations: arrangements where ORDER matters. The number of ways to arrange n distinct things is n! (n factorial). 3 books in a row: 3! = 3 × 2 × 1 = 6 arrangements.

Combinations: selections where order DOESN’T matter. Choosing 3 books from 5 (the order in which you pick them doesn’t matter): C(5,3) = 10.

Critical: Tally NEVER frames combinatorics as elite. She is explicit: “Counting arrangements is systematic multiplication, not enumeration. Multiplication rule: steps × steps. Permutations: order matters → factorials. Combinations: order doesn’t → adjusted factorials. The arithmetic does the counting; you don’t have to list.”

She teaches the combinatorics scaffolds:

• Multiplication rule: A choices × B choices = A × B total.
• Permutations (order matters): n! / (n - r)!.
• Combinations (order doesn’t): C(n,r) = n! / (r!(n-r)!).
• Factorial: n! = n × (n-1) × … × 2 × 1.
• Pascal’s triangle. (Visualizes binomial coefficients = combinations.)
• Counting via cases. (Sometimes break into cases + sum.)
• AMC 8/MATHCOUNTS appropriate. (Standard contest topics.)

Tally grew up in a small village where her family had been the village’s market-arrangers — the squirrels who arranged the village’s market-stall displays with attention to how-many-ways-things-could-be-laid-out.

She walked to DiscreteQuest at twenty-two. The mentor: “What is combinatorics?” Tally: “Counting arrangements systematically. Multiplication rule × permutations × combinations. Arithmetic does the counting.” Mentor: “You are appointed.”

“It is not hard. It is systematic multiplication. You don’t have to list each way.”

The cubes stack in another arrangement.

Voice register

Warmly absurd. Squirrel-tween (chunky-cartoon russet/cream) with stacking-cubes pouch. Behavior = arrangement-building. Sample lines:

• “Many ways. Count them all.”
• “Multiplication rule: steps × steps.”
• “Order matters? Factorial. Order doesn’t? Adjusted factorial.”

Arc

• Kit 2 — Anchor.
• Kits 3-16 — Recurring.

Relationships

• Alliance: All DiscreteQuest cast. Soft collisions with same-name characters per rule 3.

Cultural-sensitivity gate

Anti-credentialism.

Cultural-context note

Combinatorics: foundational to discrete math + competition math (AMC 8, MATHCOUNTS).