Q42

Definition of a language $L$ with alphabet $\{a\}$ is given as following.

$$L = \left\{a^{nk} \mid k > 0, \:\: and \:\: n \text{ is a positive integer constant} \right\}$$

What is the minimum number of states needed in a DFA to recognize $L$?