There is an intuitive way to see that for any natural numbers m and n, n√m will always either be an integer or an irrational number.
Suppose that there was some n√m that was a rational number ab that was not an integer. Suppose further that ab is written as a [-reduced] fraction, such that the Greatest common divisor of a and b is 1. Then, since ab is not an integer, b>1.
Since ab=n√m, we have conversely that (ab)n=m, which is a natural number by our hypothesis. But let's take a closer look at (ab)n. It evaluates to anbn, which is still a reduced fraction. [todo: Proof of gcd(a^n, b^n) = 1.]
But since b>1 before, we have that bn>1 as well, meaning that (ab)n cannot be an integer, contradicting the fact that it equals m, a natural number.