Show that C(n) = {a^k | k is a multiple of n} is a regular language
It’s easy to construct a DFA which recognize $a^n$. 

Then add an $\epsilon$ transition from all its final state to its initial state.