UNIVERSITY OF TORONTO SCARBOROUGH

NOVEMBER 2011 MIDTERM EXAMINATION SOLUTIONS

MATA31H3 F
Calculus for Mathematical Sciences I
Leo Goldmakher
Duration 2 hours
Aids: none
NAME (PRINT):
Last/Surname First/Given Name
STUDENT NO:
TUTORIAL:
Tutorial section Name of TA
Qn. # Value Score
1 11
2 6
3 16
4 15
5 6
Total 54
Qn. # Value Score
6 8
7 18
8 8
9 5
10 7
Total 46
TOTAL:
Please read the following statement and sign below:
I understand that any breach of academic integrity is a violation of The Code of Behaviour on Academic Matters. By
signing below, I pledge to abide by the Code.
SIGNATURE:
Midterm Exam MATA31H3 page 2 of 19
PROPERTIES OF NUMBERS
Throughout this course, we assume that there exists a set o (called the set of numbers) endowed
with two operations + and , as well as a special subset T o (called the set of positive numbers),
which satisfy all the following properties:
(P1) a, b, c o, we have a + (b + c) = (a + b) + c.
(P2) There exists a number 0 o such that a o, a + 0 = 0 + a = a.
(P3) For each a o there exists a number a o such that a + (a) = (a) + a = 0.
(P4) a, b o, we have a + b = b + a.
(P5) a, b, c o, we have a (b c) = (a b) c.
(P6) There exists a number 1 o such that a o, a 1 = 1 a = a. Moreover, 1 ,= 0.
(P7) For each a o, there exists a number a
1
o such that a a
1
= a
1
a = 1.
(P8) a, b o, we have a b = b a.
(P9) a, b, c o, we have a (b + c) = a b + a c.
(P10) For each number a o, one and only one of the following holds:
(a) a = 0
(b) a T
(c) a T
(P11) If a, b T, then a + b T.
(P12) If a, b T, then a b T.
SHORTCUTS AND NOTATION
a = b : a and b are the same number.
A = B : A and B are the same set.
a b : a + (b)
a
b
: a b
1
a > b : a b T
b < a : a > b
a b : a b T 0
b a : a b
: for all
: there exists
A = B : If A is true, then B must be true.
A = B : If B is true, then A must be true.
A B : A = B and A = B; A and B are equivalent.
a A : a is an element of the set A.
A B : A is a subset of B.
N : The set of natural numbers (i.e. the positive integers)
Z : The set of all integers
Q : The set of all rational numbers (i.e. fractions)
R : The set of all real numbers
continued on page 3
Midterm Exam MATA31H3 page 3 of 19
(1) For this problem, you must justify each step using P1P12. In other words, you cannot use
anything proved in the book or in class without justifying it here.
(a) (3 points) Prove that a 0 = 0 for any number a.
From (P2) and (P9) we see that
a 0 = a (0 + 0) = a 0 + a 0.
It follows that
0 = a 0 a 0 by (P3)
= (a 0 + a 0) a 0 by above
= a 0 + (a 0 a 0) by (P1)
= a 0 + 0 by (P3)
= a 0 by (P2).
(b) (4 points) Prove that (1) (1) = 1.
From (P6) and (P9) we see that
(1) (1 1) = 1 1 + (1) (1) = (1) + (1) (1).
But also, (P3) and part (a) imply that
(1) (1 1) = (1) 0 = 0.
It follows that
(1) (1) = (1 1) + (1) (1) by (P3) and (P2)
= 1 +

1 + (1) (1)

by (P1)
= 1 + 0 by above
= 1 by (P2).
(c) (4 points) Recall that 2 is dened to be 1 + 1. Prove that 2 > 0. [Hint: you may nd part
(b) helpful.]
From (P6), we know that 1 ,= 0. (P10) thus implies that either 1 T, or
1 T, but not both. If 1 T, then part (b) and (P12) would imply
1 T, contradicting (P10). Therefore, 1 T. Finally, (P11) implies that
2 = 1 + 1 T, whence 2 > 0.
continued on page 4
Midterm Exam MATA31H3 page 4 of 19
Page intentionally left blank for scratch work.
continued on page 5
Midterm Exam MATA31H3 page 5 of 19
(2) (6 points) Prove that between any two distinct real numbers there is a rational number.
Suppose x and y are distinct real numbers. Without loss of generality, we may
assume that x < y. Then y x > 0, whence
1
yx
> 0. It follows that n N such
that n >
1
yx
, or equivalently,
nx + 1 < ny.
I now claim that nx < nx| + 1 < ny. Indeed, by denition of the oor function,
nx| nx < nx| + 1, whence
nx < nx| + 1 nx + 1 < ny.
We thus conclude that
x <
nx| + 1
n
< y.
Since nx| + 1 Z and n N, we have constructed a rational number between x
and y.
continued on page 6
Midterm Exam MATA31H3 page 6 of 19
(3) (a) (2 points) State the Principle of Induction.
Given A N such that
(i) 1 A, and
(ii) n A = n + 1 A for every n N.
Then A = N.
(b) (2 points) State the Principle of Strong Induction.
Given A N such that
(i) 1 A, and
(ii) 1, 2, . . . , n A = n + 1 A for every n N.
Then A = N.
(c) (2 points) State the Well-Ordering Principle of N.
Every non-empty subset of N has a least element.
continued on page 7
Midterm Exam MATA31H3 page 7 of 19
(d) (10 points) Prove that the Well-Ordering Principle of N is equivalent to Induction. You
may assume that Induction and Strong Induction are equivalent (i.e. you can use In-
duction and Strong Induction interchangeably).
(=)
Given A N which satises the Induction hypotheses (i) and (ii). Let A = NA. If
A = , then A = N and were done. Otherwise, W.O.P. guarantees that A contains
a least element a, say. Note that since 1 A, 1 , A, so a 1 N. Also, since a is
the least element of A, a 1 A. But then hypothesis (ii) would imply that a A,
contradicting the assumption that a A. This contradiction implies that A must
be empty, whence A = N. Induction is proved.
(=)
Given A N, let A = NA as above. Suppose A has no least element. Then 1 , A
(else it would be the least element!), so 1 A. Now suppose 1, 2, . . ., n A, so
that 1, 2, . . . , n , A. Then n + 1 , A, else it would be the least element of A. Thus
n + 1 A. Thus A meets all the hypothesese of strong induction, and we conclude
that A = N. But this implies that A = ! This is precisely the Well-Ordering
Principle.
continued on page 8
Midterm Exam MATA31H3 page 8 of 19
Page intentionally left blank for scratch work.
continued on page 9
Midterm Exam MATA31H3 page 9 of 19
(4) (3 points each) Identify whether each of the following is a function. If it is, specify the do-
main and range. If not, explain why not.
(a) f = (n, d) : n N and d is the leftmost (nonzero) digit of n
Yes. The domain is N. The range is 1, 2, 3, 4, 5, 6, 7, 8, 9.
(b) g = (t
2
+ 1, t) : t R
No. For example, (5, 2) g, i.e. g(5) has two possible values.
(c) h =

(r, a + b) : r Q and r =
a
b

No. For example, (2/3, 5) h, i.e. h(2/3) has two possible values.
(d) F = (1, 2), (2, 3), (3, 6), (4, 2)
Yes. The domain is 1, 2, 3, 4. The range is 2, 3, 6.
(e) G = (1, 2), (2, 3), (3, 6), (2, 4)
No. For example, (2, 3) and (2, 4) both belong to G, or in other words, G(2)
has two possible values.
continued on page 10
Midterm Exam MATA31H3 page 10 of 19
(5) (6 points) Prove by induction that
1 + x + x
2
+ + x
n1
=
x
n
1
x 1
for any x R 1 and any n N.
Fix any x ,= 1, and set
A =

n N :
n1

k=0
x
k
=
x
n
1
x 1

.
1 A, since
x1
x1
= 1. Moreover, if n A, then
1 + x + x
2
+ + x
n1
+ x
n
=
x
n
1
x 1
+ x
n
=
x
n+1
1
x 1
.
In other words, n A = n + 1 A.
By induction, A = N, whence the claim holds for all n N. Since x ,= 1 is arbitrary,
we conclude the proof.
continued on page 11
Midterm Exam MATA31H3 page 11 of 19
(6) (8 points) Given two countable sets A and B, prove that A B must also be countable.
Let a
1
, a
2
, a
3
, . . . be an enumeration of A, and let b
1
, b
2
, b
3
, . . . be an enumeration
of B. For each n N, dene
c
n
=

a
(n+1)/2
if n is odd
b
n/2
if n is even
and set
C = c
1
, c
2
, c
3
, . . ..
I claim that C = A B:
C A B
For every n N, c
n
A (if n is odd) or c
n
B (if n is even). It follows
that c
n
A B.
A B C
Given c A B, we must have either c A or c B. If c A, then
c = a
k
for some k N, and c = c
2k1
C. Similarly, if c B, then c = a
k
for some k N, and c = c
2k
C.
Thus, A B = c
1
, c
2
, c
3
, . . .. We thus conclude that A B is countable.
continued on page 12
Midterm Exam MATA31H3 page 12 of 19
Page intentionally left blank for scratch work.
continued on page 13
Midterm Exam MATA31H3 page 13 of 19
(7) Consider the two functions f : R R and g : R R dened by f(x) = x
2
and g(x) = x|.
Note: you may not refer to anything done in lecture or the textbook for any part of this question!
(a) (3 points) Does f g = g f? If yes, prove it. If no, justify by example.
No: (f g)(1.5) = f(1) = 1, while (g f)(1.5) = g(2.25) = 2.
(b) (5 points) Does lim
x3
f(x) exist? Justify your answer with a proof.
Claim: lim
x3
f(x) = 9.
Proof: Given > 0, set = min1, /7. Then > 0, /7, and 1. It
follows that whenever 0 < [x 3[ < , we have
[f(x) 9[ = [x 3[ [x + 3[ < (6 + )

7
7 =
continued on page 14
Midterm Exam MATA31H3 page 14 of 19
(c) (5 points) Does lim
x3
g(x) exist? Justify your answer with a proof.
Claim: lim
x3
g(x) does not exist.
Proof: Suppose lim
x3
g(x) = L. Let = 1/4. Then for any > 0, pick
x =

3 /2 if L 2.5
3 + /2 if L < 2.5
If L 2.5, we see that
[g(x) L[ = [2 L[ = L 2 1/2.
Similarly, if L < 2.5 then
[g(x) L[ = [3 L[ = 3 L > 1/2.
Thus in either case we have 0 < [x 3[ < and [g(x) L[ > .
(d) (5 points) Does lim
x
1
g(x)
exist? Justify your answer with a proof.
Claim: lim
x
1
g(x)
= 0.
Proof: Given > 0.
Note that by denition of the oor function, we have
g(x) x < g(x) + 1.
It follows that g(x) > x 1, whence
1
g(x)
<
1
x 1
.
Therefore, for any x >
1

+ 1 we have

1
g(x)

=
1
g(x)
<
1
x 1
<
1
1/
= .
Thus,
x >
1

+ 1 =

1
g(x)
0

< .
continued on page 15
Midterm Exam MATA31H3 page 15 of 19
Page intentionally left blank for scratch work.
continued on page 16
Midterm Exam MATA31H3 page 16 of 19
(8) (8 points) Solve one of the following two problems. Do not solve both! If you have work
written down for both, indicate which one of the questions you wish to be marked. Note
that you may not refer to any proofs done in class or the book you must justify every step.
(a) Prove that
3

4 , Q, where x =
3

4 is the real number satisfying x

3
= 4.
(b) Prove that

3 , Q.
Ill prove (a) using one method, and (b) using another.
(a) Let
A = n N : n
3

4 Z
Suppose b A. Then
3

4 =
a
b
for some a Z, whence
a
3
= 4b
3
.
In particular, a
3
must be even. This implies that a itself must be even.
(This is because if a were odd, say, a = 2k + 1, then a
3
= 8k
3
+ 12k
2
+
6k + 1 = 2(4k
3
+ 6k
2
+ 3k) + 1 would be odd as well.)
Thus, we can write a = 2m for some m Z. Plugging this into our
earlier equation, we see that
8m
3
= 4b
3
.
It follows that b
3
= 2m
3
, whence b
3
must be even, which (as before)
tells us that b must be even. This means we can write b = 2M for some
M N. Finally, we see that
3

4 =
a
b
=
m
M
.
Since M A and M < b, we conclude that A has no least element. By the
Well-Ordering Principle, this is only possible if A = . But this means
that
3

4 cannot be expressed in the form

a
n
for any a Z and n N, i.e.
3

4 , Q.
(b) Let
A = n N : n

3 Z.
I claim that n A = (

3 1)n A.
Indeed, it is easy to verify that if n A, then (

3 1)n Z.
Moreover, since

3 1 > 0, we have (

3 1)n N. Finally, it
is straightforward to check that (

3 1)n

3 Z.
But now observe that (

3 1)n < n, since

3 < 2. The Well-Ordering
Principle one again shows that A has no least element. This implies that
A = , and hence, that

3 , Q.
continued on page 17
Midterm Exam MATA31H3 page 17 of 19
(9) (5 points) Find the mistake in the following proof. Make sure you carefully explain why
its a mistake.
Claim: Every integer n 2 is even.
Proof: We will use strong induction.
Base case: the claim clearly holds for n = 2.
Now suppose that 2, 3, 4, . . . , n 1 are all even. Then we can write n 2 = 2k for
some integer k, so
n = 2 + (n 2) = 2 + 2k = 2(k + 1),
and is therefore even. By strong induction, we conclude that every integer greater
than 2 is even.

The base case is insufcient: the proof fails to deduce the case n = 3 already, since
one must know some information about n 2 (and we started with n = 2). Thus,
the base case would have to include both 2 and 3 for this proof to work.
continued on page 18
Midterm Exam MATA31H3 page 18 of 19
(10) (7 points) Recall that the Fibonacci sequence 1, 1, 2, 3, 5, 8, 13, 21, . . . is dened by
f
1
= f
2
= 1 and f
k
= f
k1
+ f
k2
k 3.
Prove that every natural number can be written as the sum of distinct Fibonacci numbers.
We proceed by strong induction.
Let A = n N : n can be written as the sum of distinct Fibonacci numbers. We
have 1 A, since 1 is a Fibonacci number.
Now suppose that 1, 2, . . . , n 1 A. We wish to show that it n A. Let f
k
denote
the largest Fibonacci number such that f
k
n. If n = f
k
, were done. Otherwise,
n f
k
A by hypothesis, and can therefore be written as the sum of distinct
Fibonacci numbers:
n f
k
=

i
f
m
i
where the m
i
are distinct natural numbers.
By construction, we see that
f
k
n < f
k+1
.
It follows that
n f
k
< f
k+1
f
k
= f
k1
;
in particular, m
i
< k 1 for every i. Thus, we have
n = f
k
+

i
f
m
i
which is the sum of distinct Fibonacci number.
We have shown that 1 A and that 1, 2, . . . , n 1 A = n A. By strong
induction, we conclude that A = N.
continued on page 19
Midterm Exam MATA31H3 page 19 of 19
Page intentionally left blank for scratch work.
Total Marks = 100 points