How would you prove that the following language is not context-free?$$ L= \{a^n b^m |\, gcd(n,m)=1 \}$$I suspect the solution uses the pumping lemma, but I'm not sure how to apply it.
Proof that a language involving $gcd$ is not context-free
formal languages;formal grammars