$X^n-Y^m$ is irreducible in $\Bbb{C}[X,Y]$ iff $\gcd(n,m)=1$ 
I am trying to show that $X^n-Y^m$ is irreducible in $\Bbb{C}[X,Y]$ iff $\gcd(n,m)=1$ where $n,m$ are positive integers. 

I showed that if $\gcd(n,m)$ is not $1$, then $X^n-Y^m$ is reducible. How to show the other direction. Please help.
 A: I think Hagen von Eitzen's proof is good but not as explicite at the end.
I'll try to clarify:
"Assume $f(X,Y) =X^n-Y^m=g(X,Y)h(X,Y)$. Then $f(Z^m,Z^n)=0$ implies that one of $g(Z^m,Z^n)$ or $h(Z^m,Z^n)$, wlog $g(Z^m,Z^n)$, is the zero polynomial.
That means that for all $k$, the monomials cancel, i.e. if $$g(X,Y)=\sum a_{i,j}X^iY^j $$
then
$$ \sum_{mi+nj=k}a_{i,j}=0 $$
Can we ever have $mi+nj=mi'+nj'$? That would mean $m(i-i')=n(j'-j)$. It follows that $i=i'(\bmod n)$ and $j=j'(\bmod m)$. But $i,i'\in {0,1,...,n-1}$ and $j,j'\in {0,1,...,m-1}$. This implies $i=i'$ and $j=j'$."
Overall, $mi+nj=mi'+nj'$ is echivalent with $i=i'$ and $j=j'$. So distinct terms from $g$ and $h$ corespond to distinct terms in $g(Z^m,Z^n)$ and $h(Z^m,Z^n)$. So when we substitute $X=Z^m$ and $Y=Z^n$ none of the terms $g(Z^m,Z^n)$ and $h(Z^m,Z^n)$ will cancel out so that $g(Z^m,Z^n)=0$ and $h(Z^m,Z^n)=0$. That means $g(Z^m,Z^n)\ne0\ne h(Z^m,Z^n)$, but $0=f(Z^m,Z^n)=g(Z^m,Z^n)h(Z^m,Z^n)\ne0$, contradiction.
A: Lemma: If $f \in \mathbb{C}[X,Y]$ is irreducible polynomial over $\mathbb{C}(Y)$, then  its factorization in $\mathbb{C}[X,Y]$ consists of an irreducible polynomial and zero or more univariate polynomials in $Y$.

Theorem: If $\gcd(m,n) = 1$, then $S^m - T^n$ is an irreducible polynomial in one variable ($S$) over the field $K = \mathbb{C}(T)$.
Proof: The $m$ distinct roots of this polynomial are the values $\zeta^k T^{n/m}$ lying in the field $L = \mathbb{C}(T^{1/m})$, where $\zeta$ is a primitive $m$-th root of unity.
We can find $a,b$ so that $am + bn = 1$. This implies
$$ T^a \left(T^{n/m} \right)^b = T^{(am + bn)/m} = T^{1/m}$$
and so $L = K(T^{n/m})$. There are a number of ways to infer that $S^m - T^n$ is irreducible from this; e.g. $[L:K] = m$ along with the fact $S^m - T^n$ is degree $m$ mean that $S^m - T^n$ is the minimal polynomial of $T^{n/m}$ over $K$. $\square$
A: Let $K$ be any field, e.g. $K=\Bbb C$, let $m,n \in \Bbb N$ with $\gcd(n,m)=1$
By Gauss' lemma, it is sufficient to show that $X^n-Y^m$ is irreducible in $K(Y)[X]$, now $K(Y) / K(Y^m)$ is a degree $m$ extension and $Y^m$ is a prime element of $K[Y^m]$ since $K[Y^m]/(Y^m) \cong K$, thus $X^n-Y^m$ is irreducible over $K(Y^m)$ by the Eisenstein criterion. Now as $\gcd(\mathrm{deg}_X(X^n-Y^m);[K(Y):K(Y^m)])=1$, this implies that $X^n-Y^m$ is also irreducible over $K(Y)$, compare this question.
A: Assume $f(X,Y) =X^n-Y^m=g(X,Y)h(X,Y)$. Then $f(Z^m,Z^n)=0$ implies that one of $g(Z^m,Z^n)$ or $h(Z^m,Z^n)$ is the zero polynomial. Suppose that $g(Z^m,Z^n)=0$. That means that for all $k$, the monomials cancel, i.e. if $$g(X,Y)=\sum a_{i,j}X^iY^j $$
then $$\sum_{mi+nj=k}a_{i,j}=0.$$
Can we ever have $mi+nj=mi'+nj'$? That would mean $m(i-i')=n(j-j')$, hence $n\mid i-i'$ (because none of $n$'s prime factors are in $m$) and likewise $m\mid j-j'$. So if $i>i'$ this implies $j> j'$.
A: Geometric solution.
Consider the morphism of affine varieties $\mathbb{A}^1 \to V(X^n-Y^m), t \mapsto (t^m,t^n)$. It is surjective: If $x^n=y^m$ in $\mathbb{C}$, wlog $x,y \in \mathbb{C}^*$,  choose some $t \in \mathbb{C}^*$ such that $x=t^m$. Then $y^m=x^n=t^{mn}$, hence $y=t^n \cdot \zeta$ for some $\zeta \in U(m)$. Since $m,n$ are coprime, $\zeta=\eta^n$ for some $\eta \in U(m)$. Then $t \eta$ is a preimage of $(x,y)$.
It follows that $V(X^n-Y^m)$ is irreducible, i.e. $\sqrt{(X^n-Y^m)}$ is a prime ideal. But the ideal $(X^n-Y^m)$ is radical, because $X^n-Y^m$ is square-free, since $\partial_X (X^n-Y^m)=n X^{n-1}$ and $X^n-Y^m$ are coprime in $\mathbb{C}(Y)[X]$.
