Show that there is no pair of integers p,q with q=0 such that (qp)2=2.
Equivalently: the diagonal of a square is incommensurable with its side. That older phrasing is worth keeping in view, because the discovery landed as a fact about geometry a long time before it was a fact about numbers.
The standard proof is four lines of parity. It is correct, and it is also faintly unsatisfying — it tells you no such fraction exists without showing you what goes wrong when you try to build one.
So post the argument you find most illuminating, and be explicit about what you are assuming. Unique factorization is a heavy tool to bring to a problem this small.
The older statement — side and diagonal share no common measure
Let's assume that 2 is rational such that qp is in it's simplest/irreducible form. qp=2 Then taking the square of both sides.
(qp)2=2=q2p2
p2=2q2 since p2=2q2 the p must be even, hence p=2k (2k)2=2q2
4k2=2q2 2k2=q2 therefore q must be even too.
Since both p and q share a common factor 2, qp cannot be the simplest form. This forms a contradiction with primary assumptions therefore 2 cannot be expressed in terms of p and q.