2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/130404We present and prove a theorem answering the question "how many states does a minimal deterministic finite automaton (DFA) that recognizes the set of base-b numbers divisible by k have?"LaTeX, 7 pages (corrected typo in new version)Computational ComplexityF.1.1; F.4.3text