Base Systems is the habit of changing number bases to expose digit constraints, divisibility, and place-value structure. In contest math, that habit turns a crowded setup into a relation the student can test, bound, count, or compute. MathGrit teaches it as a recognizable signal, a deliberate move, and a final translation back to the original question.
Writing an integer in base $b$ expresses it as a sum of digits times powers of $b$, exposing place-value, digit, and divisibility structure.
Why It Works
1
Repeatedly divide $n$ by $b$: the remainder at each step is the next digit $d_i$, and the quotient is carried forward.
2
This terminates because the quotient strictly shrinks, and each remainder satisfies $0 \le d_i < b$.
3
Reassembling gives $n = d_0 + d_1 b + d_2 b^2 + \cdots$, the base-$b$ representation, which is unique.
4
Digit tests come from reducing each power $b^i$ modulo $m$: since $b \equiv 1 \pmod{b-1}$, every $b^i \equiv 1$, so $n \equiv \sum_i d_i$ (the digit sum) $\pmod{b-1}$; and since $b \equiv -1 \pmod{b+1}$, $b^i \equiv (-1)^i$, so $n \equiv \sum_i (-1)^i d_i$ (the alternating digit sum) $\pmod{b+1}$.
Worked Examples
Example 1
Convert the decimal number $45$ to base $3$.
1
Divide by $3$: $45 = 15 \cdot 3 + 0$, so the units digit is $0$.
How many integers $n$ with $1 \le n \le 1023$ have exactly three $1$s in their binary (base-$2$) representation?
1
Note $1023 = 2^{10} - 1 = \underbrace{11\cdots1}_{10}{}_2$, so the integers $1, 2, \dots, 1023$ are exactly those expressible with the $10$ bits in positions $0$ through $9$.
2
An integer with exactly three $1$s in binary corresponds to choosing which $3$ of these $10$ bit-positions are set to $1$ (the rest $0$).
3
The number of such choices is $\binom{10}{3}$.
4
Compute $\binom{10}{3} = \frac{10 \cdot 9 \cdot 8}{6} = 120$. (Each choice gives a distinct value in range, e.g. bits $\{0,1,2\}$ give $7$.)
Answer:
$120$
Olympiad / Challenge
Let $b \ge 2$ be an integer base. Prove that a positive integer $n$ is divisible by $b - 1$ if and only if the sum of its base-$b$ digits is divisible by $b - 1$ (the generalized 'casting out nines').
1
Write $n = \sum_{i=0}^{k} d_i b^i$ in base $b$, with digits $0 \le d_i < b$.
2
Since $b \equiv 1 \pmod{b - 1}$, raising to powers gives $b^i \equiv 1^i = 1 \pmod{b - 1}$ for every $i \ge 0$.
3
Therefore $n = \sum_i d_i b^i \equiv \sum_i d_i \cdot 1 = \sum_i d_i \pmod{b - 1}$ — i.e. $n$ is congruent to its digit sum modulo $b - 1$.
4
Hence $(b-1) \mid n \iff (b-1) \mid \sum_i d_i$. (Taking $b = 10$ recovers the rule that $9 \mid n$ iff $9$ divides the decimal digit sum.)
Answer:
$n \equiv (\text{digit sum}) \pmod{b - 1}$, so $(b-1) \mid n \iff (b-1)$ divides the digit sum.
Going Deeper
Generalization: the place-value identity $n = \sum d_i b^i$ powers every digit-based divisibility test via $b^i \bmod m$. Since $b \equiv 1 \pmod{b-1}$, digit sums test divisibility by $b - 1$ (and any divisor of it); since $b \equiv -1 \pmod{b+1}$, alternating digit sums test divisibility by $b + 1$ (e.g. the $11$-rule in base $10$). Other bases expose structure decimal hides — balanced ternary, binary for bit tricks, factorial base for permutation ranking.
Where it appears: divisibility rules, digit-sum and digit-reversal problems, counting integers with digit constraints (often a combinatorial choice as above), repunit and repdigit questions, and converting between bases in clock/odometer puzzles.
Pitfall: the representation $n = \sum d_i b^i$ requires each digit to satisfy $0 \le d_i < b$ — a 'base-$b$' string with a digit $\ge b$ is not a valid representation and breaks uniqueness. Also, the digit-sum rule tests $b - 1$ (and its divisors), NOT arbitrary moduli: in base $10$ it gives the $3$- and $9$-rules but says nothing direct about divisibility by $7$.
Spot the Signal
Look for problems where the key step is changing number bases to expose digit constraints, divisibility, and place-value structure.
You can describe the hard part as changing number bases to expose digit constraints, divisibility, and place-value structure, but a direct attack starts producing clutter.
The problem rewards preserving structure instead of expanding, listing, or guessing too early.
Learn the Move
Start by identify the integer constraint that calls for base systems, then rewrite the givens around it.
Name the relation that makes Base Systems legal before doing computation.
Use the new relation to replace the messiest part of the problem with a cleaner one.
Translate the result back to the quantity the problem actually asks for.
Avoid These Traps
Do not use Base Systems just because the surface looks familiar; verify the required condition first.
Applying Base Systems because it sounds relevant, without checking the trigger first.
Stopping after spotting the technique instead of finishing the calculation or proof.
MathGrit Coach Note
Let base systems reveal the integer structure; then compute only what remains.
Try it on:
Practice a contest problem where the key step is changing number bases to expose digit constraints, divisibility, and place-value structure.