Use the pumping lemma to prove language Lc is not regular:

L = {ap : p s prime, i.e. p = 2, 3, 5 . . . }