This is a proof that I’ve seen, not one I’ve come up with; I don’t have a reference, but I imagine it’s relatively well-known. It’s not the usual proof, but I like this one because it doesn’t rely on an infinite regress.

The following works for 2, but also (with some work) for any integer that isn’t a perfect square, or (with some more) for any rational number that isn’t one square divided by another.

Proposition: 2 is irrational.

Proof: Suppose for the sake of contradiction that 2=ab, where a is a non-negative integer and b a positive integer.

Then a2=2b2.

In the prime factorisation of a2 and of b2, each prime appears an even number of times. In particular, 2 appears an even number of times in a2 and an odd number of times in 2b2. By the fundamental theorem of arithmetic, the two sides cannot be equal, hence our supposition cannot be true