regular language

Question

C = {a^k | k is multiple of n }. Then how to show that for each n>=1, the language C is regular.

Answer 1

we put n equal to 1 . now we can take any value of k and it is always multiple of 1. so regular expression become a*. which is regular.