  The feasibility of a classification-by-rank program for modular categories
follows from the Rank-Finiteness Theorem. We develop arithmetic, representation
theoretic and algebraic methods for classifying modular categories by rank. As
an application, we determine all possible fusion rules for all rank=$5$ modular
categories and describe the corresponding monoidal equivalence classes.
