It's not an assignment question, but I'm trying to prove that $L$ is not context free. $$ L = \{a^i b^j a^k \mid i \neq j, j \neq k, k \neq i; i, j, k > 0\} $$
Edit:
Thanks for helping me with this thread.
Source: I came across this question in an old exam.
I want to find the solution out of curiosity.
I know a context free language is a language with a CFG. Example: $a^n b^n$
I believe we could use the pumping lemma for context free languages, choosing the word = $a^{n!} b^{(n+1)!} c^{(n+2)!}$ but I couldn't find a good w=uvxyz to prove it! Thank you all.