Possible Duplicate:
Language of the values of an affine function
Let $C_n = \{x\mid x \text{ is a binary number that is a multiple of } n\}$. Show that for each $n$, the language $C_n$ is regular.
Just provide a generic recipe (i.e., a formal definition for arbitrary $n$).
