We can use the pumping lemma to show that some languages are non regular.

Please note, carefully, hat the theorem guarantees the existence of a number as well as the decomposition of the string w to xyz. But it is not known what they are. So, if the theorem is violated for particular values of