×

# Theorems on Rationals

We present three theorems involving rational numbers.

### $$n$$th Power Theorem. Let $$n$$ be a positive integer. If $$a$$ is a positive integer such that $$a = r^n$$ for some rational number $$r$$, then $$r$$ must be an integer.

Proof: We apply the integer root theorem to the polynomial $$x^n - a$$. Since this polynomial has a rational root $$r$$, this root must be an integer.$$_\square$$



### Theorem 2. If the sum and product of two rational numbers are both integers, then the two rational numbers must be integers.

Proof: We have $$r_1 + r_2 = b$$ and $$r_1 \cdot r_2 = c$$, hence $$r_1, r_2$$ are rational roots of the polynomial $$x^2 - bx + c$$. By the integer root theorem, $$r_1$$ and $$r_2$$ are both integers. $$_\square$$



### 2. $$a$$ divides both $$b$$ and $$c$$.

Proof: By the Remainder Factor Theorem, if the roots are integers $$n$$ and $$m$$, then $$f(x) = a (x-n)(x-m)$$. By comparing terms, we obtain $$b = -a(n+m)$$ and $$c = anm$$. Hence, (2) is satisfied. Furthermore, $b^2 - 4ac = a^2 (n+m)^2 - 4 a \times anm = a^2 (n-m)^2,$ so (1) is also satisfied.

Conversely, by the quadratic formula, the roots of $$f(x)$$ are $$\frac {-b \pm \sqrt{b^2- 4ac} }{2a}$$. By condition (1), it follows that the roots are rational. By condition (2) and Vieta's formula, both the sum and product of the roots are integers. Hence by Theorem 2, the roots are integers. $$_\square$$

Note by Calvin Lin
2 years, 10 months ago

Sort by:

what's &nbsp? · 2 years, 5 months ago

It was meant to be a non-breaking space, to separate out indented paragraphs. I wanted the theorems to be displayed individually, instead of in a long chunk of text. Staff · 2 years, 5 months ago

Something like a non-breaking space.

Edit: Actually, it's   · 2 years, 5 months ago