Math 4023, Introduction to Analysis Name:

Assignment 1 Due: June 14, 2019

Reading: Sections 1.2–1.4, 3.1.

1. Recall that an integer m is even if and only if m = 2k for some integer k, and m is
odd if and only if m = 2k + 1 for some integer k. Prove the following.
(a) If p and q are even, then ap + bq is even for any integers a and b. (Hint: this is a
“for every” statement, so in your proof you should (1) choose arbitrary integers
meeting the hypothesis; (2) use the definition of “even” to give more information;
(3) perform the calculations indicated by the result you wish to prove; and (4)
use the definition of “even” again to reach your conclusion.)

(b) If pq is odd, then p is odd and q is odd. (Hint: try contradiction or indirect proof.)

(c) If pq is even, then p is even or q is even. (Hint: see special comments about
proving “or” statements in video 1.4 part 3.)
2. Let n be an integer. If n2 is even, prove that n is even. Give two proofs of this fact:

(a) Give a direct proof. (Hint: you will need to use the fact that if p is a prime
number and if p divides ab, where a and b are integers, then either p divides a or
p divides b. Note that 2 is prime.)

(b) Give either an indirect proof or a proof by contradiction.

3. Let x be real and let f (x) = 3x + 5.

(a) For every x1 , x2 ∈ R, if f (x1 ) = f (x2 ), prove that x1 = x2 .

(b) If 0 ≤ x ≤ 1, prove that 5 ≤ f (x) ≤ 8.

4. Let x be real and let f (x) = 3x + 5.
y−5
(a) For any real number y satisfying 5 ≤ y ≤ 8, prove that 0 ≤ ≤ 1.
3

 
y−5
(b) For any real number y, prove that f = y.
3

(c) Prove that for any real number y satisfying 5 ≤ y ≤ 8, there exists x ∈ [0, 1] such
that f (x) = y. (You may use parts (a) and (b).)

5. Prove that, for every real number y > 5, there exists a real number x < 0 such that
5x
y= .
x+3
6. Use induction to prove that, for all n ∈ N,
1 1 1 n
+ + ··· + = . (1)
1·2 2·3 n(n + 1) n+1

(Hints: your proof should (i) show that equation (1) holds when n = 1; (ii) assume
there is some integer k such that equation (1) holds when n = k; and then (iii) use the
assumption in (ii) to prove that equation (1) holds when n = k + 1.)

7. Prove by induction that 12n − 5n is a multiple of 7 for all n ∈ N.

8. Conjecture a formula for the sum 5 + 9 + 13 + · · · + (4n + 1) and prove it by induction.

9. Determine for which n ∈ N the formula n2 ≤ 2n is valid, and give a proof of the formula
by induction.