composite number Pumping Lemma for L = {$0^p$∣$p$ is a composite number}
The Pumping Lemma will give you a way to generate strings in the language whose lengths are in an arithmetic progression.  If you pick the initial string right, you should be able to apply Dirichlet's (?) Theorem that arithmetic progressions having certain properties necessarily include infinitely many primes.