Number Systems
MIT‑Level Study Notes
Quantitative Aptitude – TOPIK Program
These notes present a rigorous, first‑principles treatment of positional numeral systems.
They cover integers, rationals, negative bases, and edge cases, and culminate in a challenging problem that tests deep understanding.
All derivations are fully justified; proofs are given where appropriate.
1. Positional Notation – The Fundamental Idea
A radix (or base) (b) is an integer (;b \ge 2).
A digit is an integer (d) with (0 \le d < b).
A number (N) written in base (b) as
[ N = d_k d_{k-1}\dots d_1 d_0 \quad (d_k\ne 0) ]
is interpreted as
[ N = \sum_{i=0}^{k} d_i b^{,i}. \tag{1} ]
The place value of digit (d_i) is (b^i).
We refer to the rightmost digit as the least significant digit (LSD).
Theorem 1 (Uniqueness of Representation).
For fixed (b) and fixed digit set ({0,\dots,b-1}), every integer (N) has a unique representation in the form (1) with (d_k \ne 0\