Scribd
Upload
97 views

Week 2 Worksheet Answers

This document contains a multi-part math worksheet. Part 1 defines a sequence and asks questions about finding terms, sums, and determining if the sequence is increasing. Part 2 analyzes properties of relations such as reflexivity, symmetry, etc. Part 3 verifies certain relations are equivalence relations and finds members of equivalence classes. Part 4 geometrically describes sets involving integers, circles, and the border of a square.

Uploaded by

Happy Ayich
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
97 views

Week 2 Worksheet Answers

This document contains a multi-part math worksheet. Part 1 defines a sequence and asks questions about finding terms, sums, and determining if the sequence is increasing. Part 2 analyzes properties of relations such as reflexivity, symmetry, etc. Part 3 verifies certain relations are equivalence relations and finds members of equivalence classes. Part 4 geometrically describes sets involving integers, circles, and the border of a square.

Uploaded by

Happy Ayich
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Week 2 Worksheet for Math 61

1. Define the sequence a by a0 = 3 and an = 2 + an−1 .

(a) Write out 5 terms of a starting with a0 .


3, 5, 7, 9, 11
4
P
(b) Calculate ai .
i=0
3 + 5 + 7 + 9 + 11 = 35
(c) Find a formula for ai .
ai = 3 + 2i
n
P
(d) Find a formula for sn = ai in terms of n.
i=0
n
X
sn = ai
i=0
n
X
= 3 + 2i
i=0
Xn n
X
= 3+2 i
i=0 i=0
n(n + 1)
= 3(n + 1) + 2( )
2
= 3n + 3 + n2 + n
= n2 + 4n + 3
(e) Is a non-decreasing? Is a increasing?
Yes. Yes.
(f) Is s non-decreasing? Is s increasing?
Yes. Yes.

2. For the following relations R, determine if R is reflexive, symmetric, antisymmetric,


transitive, a partial order, and/or an equivalence relation.

(a) x, y ∈ R, xRy ⇔ xy = 1.
• 2 · 2 = 4 6= 1 so R is not reflexive.
• If xy = 1 then yx = 1 so R is symmetric.
• 2R 21 and 12 R2 but 2 6= 12 so R is not antisymmetric.
• 2R 21 and 12 R2 but 2 · 2 6= 1 so R is not transitive.

1
• R is not reflexive so it is not a partial order.
• R is not reflexive so it is not an equivalence relation.
(b) x, y ∈ {Rock, Paper, Scissors}, xRy ⇔ x beats y.
• Paper does not beat paper so R is not reflexive.
• Paper beats Rock, but Rock does not beat paper so R is not symmetric.
• As we never have the case that A beats B and also B beats A, R is antisym-
metric.
• Paper beats Rock and Rock beats Scissors, but Paper does not beat Scissors,
so R is not transitive.
• R is not reflexive so it is not a partial order.
• R is not reflexive so it is not an equivalence relation.
(c) x, y ∈ {Rock, Paper, Scissors}, xRy ⇔ x beats or ties y.
• Everything ties itself so R is reflexive.
• Paper beats Rock, but Rock does not beat paper so R is not symmetric.
• We never have the case that A beats B and also B beats or ties A. Then aRb
only if a ties b which only occurs if a = b. So R is antisymmetric.
• Paper beats Rock and Rock beats Scissors, but Paper does not beat Scissors,
so R is not transitive.
• R is not transitive so it is not a partial order.
• R is not symmetric so it is not an equivalence relation.
(d) x, y ∈ Z, xRy ⇔ x − y is even.
• Recall that n is even if n = 2k for some integer k.
• x − x = 0 = 2 · 0 which is even, so R is reflexive.
• If x − y = 2k then y − x = −(x − y) = 2(−k) so R is symmetric.
• 2R0 and 0R2 but 0 6= 2 so R is not antisymmetric.
• If x − y = 2k and y − z = 2` then (x − z) = (x − y) + (y − z) = 2(k + `) so
R is transitive.
• As R is not antisymmetric R is not a partial order.
• As R is reflexive, symmetric, and transitive, R is an equivalence relation.
(e) x, y ∈ Z, xRy ⇔ x | y. (Recall that x | y iff ∃z ∈ Z such that y = xz)
• x = x cdot1 so x|x. Hence R is reflexive.
• 2|4 but 4 6 |2 so R is not symmetric.
• 1 | −1 and − 1 | 1 but 1 6= −1 so R is not antisymmetric.
• If x = yn and y = zm then x = z(nm) so R is transitive.
• As R is not antisymmetric, R is not a partial order.
• As R is not symmetric, R is not an equivalence relation.
(f) x, y ∈ Z+ , xRy ⇔ x | y. (Recall that x | y iff ∃z ∈ Z such that y = xz)

2
• x = x cdot1 so x|x. Hence R is reflexive.
• 2|4 but 4 6 |2 so R is not symmetric.
• If x = yn and y = xm then x = x2 nm. As x > 0 we have 1 = nm so
n = m = ±1.
However as x and y are both greater than 0 we have n = m = 1 so x = y.
Hence R is antisymmetric.
• If x = yn and y = zm then x = z(nm) so R is transitive.
• As R is reflexive, antisymmetric, and transitive, R is a partial order.
• As R is not symmetric, R is not an equivalence relation.

3. For each of the following relations. verify that it is an equivalence relation and give
one member from each of its equivalence classes. (There many be infinitely many
equivalence classes.)

(a) x, y ∈ Z, xRy ⇔ 3|x − y.


(Recall that 3|x−y means “3 divides x−y”. That is, ∃z ∈ Z such that x−y = 3z).
(b) x, y ∈ Z, xRy ⇔ x | y. (Recall that x | y iff ∃z ∈ Z such that y = xz)
• The proof that R is an equivalence relation is essentially the same as 2(d) so
I will not repeat it.
• {0, 1, 2} is a set containing one element from each equivalence class. For any
integer n, n dividing by 3 gives a remainder of 0, 1, or 2 so any integer is
equivalent to one of these under R. (If you want to see a proof of this fact
about remainders, read “What is a Proof?” on my website.
(c) x, y ∈ R, xRy ⇔ cos(x) = cos(y).
• cos(x) = cos(x) so R is reflexive.
• If cos(x) = cos(y) then cos(y) = cos(x) so R is symmetric.
• If cos(x) = cos(y) and cos(y) = cos(z) then cos(x) = cos(z) because = is
transitive. Hence R is transitive.
• cos(x) is injective when we restrict x ∈ [0, π) and surjective onto [−1, 1], the
range of cos(x) on all of R.
Then exactly one member of each equivalence class is in [0, π)
(d) x, y ∈ R, xRy ⇔ x − y ∈ Z.
• x − x = 0 ∈ Z so R is reflexive.
• If x − y ∈ Z then y − x = −(x − y) ∈ Z so R is symmetric.
• If x − y ∈ Z and y − z ∈ Z then x − z = (x − y) + (y − z) ∈ Z because the
sum of two integers is an integer.
• Exactly one member of each equivalence class is in [0, 1).
(e) (a, b), (x, y) ∈ R × (R \ {0}), (a, b)R(x, y) ⇔ ay = bx.
• ab = ba so R is reflexive.
• If ay = bx then xb = ya so R is symmetric.

3
• If (a, b)R(x, y) and (x, y)R(m, n) then ay = bx and xn = ym. Then x(b −
n) = y(m − a)
Hence ayxn = bxym so an(xy) = bm(xy) so an = bm so (a, b)R(m, n).
• {(num(q), den(q)) : q ∈ Q} for some choice of numerator and denominator of
q has exactly one element from each equivalence class.

4. Describe the following sets geometrically (or draw a picture)

(a) Z × Z × Z
• One way to visualize this set is to tile 3-dimensional space with 1 × 1 × 1
cubes and then look at only the corners of the cubes.
(b) S 1 × (0, 1) where S 1 = {(x, y) ∈ R2 : x2 + y 2 = 1} i.e. a circle.
You can visualize this as a collection of circles of radii in (0, 1) not inclusive
or you can view this as a cylinder with side length 1 and radius 1.

(c) ([0, 1] × {0}) ∪ ({0} × [0, 1]) ∪ ([0, 1] × {1}) ∪ ({1} × [0, 1])
• This is the border of a square.

You might also like