Minimal DFAs for Testing Divisibility

We 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?"Comment: LaTeX, 7 pages (corrected typo in new version