I have encountered this while going over the wikipedia page "irreducible polynomial".
A polynomial that is irreducible over any field containing the coefficients is absolutely irreducible. By the fundamental theorem of algebra, a univariate polynomial is absolutely irreducible if and only if its degree is one. On the other hand, with several indeterminates, there are absolutely irreducible polynomials of any degree, such as $x^{2}+y^{n}-1$, for any positive integer $n$.
How can I show that $x^2+y^n-1$ is absolutely irreducible for any positive integer $n$? I'm new so I don't have enough tools to tackle this. Any help is appreciated.