Prove that the language of bitstrings of prime length is not regular. Use the pumping lemma and a suitably chosen bitstring s of prime length. By prime length we mean bitstrings of length 2, 3, 5, 7, 11, 13, 17, 19, 23 etc.