I have to prove that the following language is not regular:
$$\{ x | x = 10^{2n} + 10^n + 1, n ≥ 1\}$$
I am trying to prove it using Pumping Lemma, however, when I expand the expression I have both addition and multiplication.
I assume that the pumping length is three ($p=3$) and I work on the following word of this language:
$$\{ 10^6 + 10^3 + 1\}$$ $$\{ 1000000 + 1000 +1\}$$