How to prove that any (integer)$^{1/n}$ that isn't an integer, is irrational? [duplicate]

Solution 1:

Your proof is fine. You can use essentially the same idea to prove the following more general statement:

Theorem. If $ P(X) \in \mathbf Z[X] $ is a monic polynomial, then any rational roots of $ P $ are integers. In other words, $ \mathbf Z $ is integrally closed.

Proof. Assume that $ q = a/b $ is a rational root with $ a, b $ coprime, and let $ P(X) = X^n + c_{n-1} X^{n-1} + \ldots + c_0 $. We have $ P(q) = 0 $, which gives

$$ a^n + c_{n-1} a^{n-1} b + \ldots + c_0 b^n = 0 $$

In other words, $ a^n $ is divisible by $ b $. This is a contradiction unless $ b = \pm 1 $, since then any prime dividing $ b $ also divides $ a $, contradicting coprimality. Hence, $ b = \pm 1 $ and $ q \in \mathbf Z $.

Solution 2:

It is basically right. However, in the beginning, $\sqrt[n]{m}$ shoulg make sense, i.e., it should be in $R$. For example, $\sqrt[2]{-2} \notin R$, then you proof is not proper.