MATH 104, SUMMER 2006, QUIZ 1 SOLUTION

BENJAMIN JOHNSON

(1) State any version of the principle of mathematical induction.

If P (n) is any statement about n, and we want to prove (n N)(P (n)) is true, it suffices
to prove
(a) P (0) is true.
(b) (n N)(P (n) P (n + 1)) is true.
(2) State the Rational Roots Theorem.
If a rational number pq (reduced to lowest terms) is the root of a polynomial with integer
coefficients, of the form an xn + + a0 , with an 6= 0 and a0 6= 0 then q divides an and p
divides a0 . 1
(3) Let F be an ordered field and let a, b, c F. Prove that |a + b + c| |a| + |b| + |c|. You may
assume without proof, any version of the triangle inequality.
Proof.
|a + b + c| = |(a + b) + c|
|a + b| + |c| (by the triangle inequality)
(|a| + |b|) + |c| (by the triangle inequality again)
= |a| + |b| + |c|


Date: June 29, 2006.

1Note: the extra hypothesis n 1 given in the textbook is actually unnecessary, because any polynomial with a
non-zero integer-valued leading coefficient and a root must already have degree at least 1.
1