0

Consider $$n = \sqrt a $$ where $a$ is any integer. Is there a rigorous, systematic method of figuring out if $n$ will or will not be a rational number?

Bart Michels
  • 26,355

1 Answers1

4

The square root of an integer is rational exactly if it is itself an integer.

Namely, suppose $p/q=\sqrt a$. Then $p^2/q^2=a$ which we assume to be an integer. But this means that $q^2$ divides $p^2$.

Now consider the prime factorizations of $p^2$ and $q^2$. Every prime that appears in $q^2$ must appear in $p^2$ with at least the same exponent. But that means that every prime that appears in the prime factorization of $q$ must appear in $p$ with at least the same exponent (each exponent in the prime factorization of $p^2$ is simply twice the corresponding exponent in the factorization of $p$). In other words, $q$ divides $p$, so $p/q$ is an integer.

  • The argument implicitly uses in several places the Fundamental Theorem of Arithmetic, i.e. the existence and uniqueness of prime factorizations. It may fail for other numbers, e.g. in $,R = \Bbb Z[\sqrt{12}],$ we have $, 3 = (\sqrt{12}/2)^2$ is the square of a proper fraction over $R$. Thus any proof must necessarily employ some property special to the ring of integers, in particular, some property not shared by all quadratic number rings, e.g. unique factorization or equivalent properties such as Euclid's Lemma. – Bill Dubuque Jan 13 '15 at 00:06