MATH 381

Common Final Exam Review Exercises

1. If your instructor won the lottery, you wouldn’t have any exams for Math 381. You
are currently taking an exam for Math 381. What can you conclude?

2. Fill in the following truth table:

p q r p∧q q∨r p ∧ (q ∨ r) (p ∧ q) ∨ (p ∧ r)
T T T
T T F
T F T
T F F
F T T
F T F
F F T
F F F

3. Fill in the following truth table:

p q ¬p q ∨ ¬p p→q
T T
T F
F T
F F

4. Determine whether the proposition (p ∧ ¬q) ∨ (q ∨ ¬p) is a tautology, a contradiction,

or a contingency.

5. Prove (p ∧ q) → (p ∨ q) is a tautology using successive substitution.

6. Prove ¬(p ↔ q) ≡ ¬p ≡ q using a truth table.

7. Show (p ∧ q) → r and ¬(p ∧ ¬(q → r)) are logically equivalent using the method of
successive substitution. Do NOT use a truth table.

8. Prove the logical equivalence

¬p ∧ (p ∨ r) ≡ (¬p ∧ r)

by applying logical equivalences you know.

9. Prove the logical equivalence

p → (¬q ∨ ¬r) ≡ ¬(p ∧ q ∧ r)

by applying logical equivalences you know.

10. Show that (p ∧ q) → r is not logically equivalent to (p → r) ∧ (q → r).

11. Determine whether each statement is true or false. No justification required.

(a) No matter what proposition is plugged in for the atomic proposition p, p ∨ F ≡ p.

(b) No matter what proposition is plugged in for the atomic proposition p, p∧T ≡ T.
(c) The following logical equivalence holds: ¬(p → q) ≡ p ∧ (¬q).
(d) The following logical equivalence holds: p → (¬q) ≡ (¬p) → q.
(e) 33 = 18 → ∀x(x2 > 0), where the domain is all real numbers.
(f) ∃m∀n(m ≥ n), where the domain is all positive integers.
(g) ∀n∃m(m ≥ n), where the domain is all positive integers.
(h) If we know that p is a necessary condition for q and that q is a sufficient condition
for r, then we know that p implies r.
(i) If we know that the statements p and q are false but that the statement p ∨ q ∨ r
is true, we can deduce that the statement r must be true.
(j) It is a valid proof technique to start by assuming the statement we want to prove
is true, then derive an obviously true statement from this assumption, thereby
concluding our original assumption had to be true since it led to a true conclusion.
(k) Every proof by contrapositive can be rewritten as a proof by contradiction.
(l) To prove a claim of the form “p if and only if q,” the following strategy will work:
i. First prove that ¬p implies ¬q,
ii. then prove that ¬q implies ¬p.
(m) To prove that the four statements p1 , p2 , p3 , and p4 are equivalent, it would be a
valid strategy to prove the following four things:
i. p1 implies p2 ,
ii. p2 implies p3 ,
iii. p3 implies p1 , and finally
iv. p4 implies p1 .
(n) If a|b and a|b + c, then a|c.
(o) If a|b and b|c, then a|b + c.
(p) For any integer n > 1, if n|ab, then n|a or n|b.

12. Let k, m, r, and w be meaningful statements. Determine whether statement (w → (¬m ∨ ¬r)) → ¬k
is logically equivalent to statement k → (m ∧ r ∧ w).

13. Let a, c, d, s and k be meaningful statements such that ((¬c ∨ d) → ¬a) ∧ (c → s) ∧ (d ∨ ¬s) =
True. Determine the truth value of statement a ∧ k.

14. Consider the compound proposition (p ∧ q) → q.

(a) Show this compound proposition is a tautology using the method of successive
substitution.
(b) Show that this compound proposition is a tautology by using a truth table.

15. Suppose p ≡ F. What is the truth value of p → q?

16. To earn this point, you should under no circumstances do the following: Do not avoid
not neglecting to write down the word “negation” below.

17. Let n > 1 be an integer. Determine which statement is vacuously true. Explain your
answer.

(a) If n is prime and divisible by 2, then n2 is even.

(b) If n is prime and divisible by 9, then n2 is odd.
(c) If n2 + n + 1 is odd, then n2 = 2.

18. Write down the negation of the statement

∃x∀y((x + y < 0) → (x2 + y 2 < 0)),

where the domain for x and y consists of all integers, so that the negation sign ¬
appears after any quantifiers. Determine the truth values of the original statement
and of its negation.

19. Let D ⊆ R. Determine the largest domain D such that the following proposition is
true:
∀x ∈ D, x2 > 4x

20. Let D ⊆ R. Determine the largest domain D such that the following proposition is
true:
∃x ∈ D, x2 > 4x

21. Let P (x, y) be the predicate “y is the favorite color of x,” where the domain of y is
colors and the domain of x is people.

(a) What does ∀x∃y, P (x, y) mean in a sentence?

(b) What does ∃y∀x, P (x, y) mean in a sentence?

22. Consider the following predicate functions:

S(x):“x is out of service” B(x): “x is busy” L(y): “y is lost”
Use quantifiers and logical operators to represent the following statement: “If there is
a printer that is in service and busy, then some print job has been lost.”

23. Let T (x, y) be the statement “student x is taking class y.” The domain of x is all
students at UNC and the domain of y is all current classes/courses at UNC. Write
each of the English statements below in terms of quantifiers and logical connectives.

(a) There is a course that every student is taking.

(b) Every student is taking either Math 381 or Math 233.
(c) There are no students taking Math 381.
(d) There are two different courses which are not being taken by any student.
(e) No student is taking all classes.
(f) Every course at UNC has at least one UNC student enrolled.
(g) Some UNC student is taking every course at UNC.
 (h) There are not any UNC students enrolled in some course at UNC.

24. For this problem, we will introduce the following notations:

A(x, y) denotes “person x was an actor in movie y.”
D(x, y) denotes “person x was a director of movie y.”
J(y) denotes “Joe likes movie y.”
C(y, z) denotes “movie y was made in country z.
O(x) denotes “person x has won an Oscar.”
[the Oscars are awards in the film industry, including “best actor” and “best director”]

Here, the universe of discourse for x is “all people” and the universe of discourse for
y is “all movies,” and the universe of discourse for z is “all countries.” Translate the
following sentences from abstract logical symbols into English or vice versa. You do
not need to have poetic or colloquial English sentences someone might actually say in
day-to-day speech, but your sentences should clearly capture the logical ideas.

(a) Tom Cruise was an actor in Mission Impossible.

(b) D(Steven Spielberg, Jaws)
( ( ( )))
(c) ∃x D(x, Star Wars) ∧ ∀z (z ̸= x) → ¬D(z, Star Wars)
( )
(d) ¬∃y A(Steve Buscemi, y) ∧ J(y) .
( )
(e) ∃x∃z∀y A(x, y) → C(y, z) .
(f) Only one actor from the movie Pulp Fiction has won an Oscar.

25. Determine the truth value of the following statements.

(a) Let n be an integer. If n2 is divisible by 8, then n is divisible by 8.

(b) ∀x(x2 ≥ x where the domain of x is R.
(c) ∀x∃y(x = y 2 ) where the domain of x and y is R.
(d) ∀x∃, xy = 1 where the domain is nonzero real numbers.
(e) ∀x∃y, xy = 1 where the domain is nonzero integers.
(f) ∃n∃m, (n + m = 4 ∧ n − m = 1) where the domain is Z.
(g) ∀n∃m, n = 2m where the domain is Z.
(h) ∀n∃m, m = 2n where the domain is Z.
( )
(i) ∀n∀m∃p, p = m+n where the domain is Z.
( 2
)
(j) ∀n∀m∃p, p = m+n
2
where the domain is Q.

26. Write the statement “For any integer n, if n2 + 2n + 7 is even, then n is odd” using
predicates and quantifiers. Then carefully write a formal proof for the statement.

27. To earn this point, you should under no circumstances do the following: Do not avoid
not neglecting to write down the word “negation” below.
28. Write down the negation of the statement

∃x∀y((x + y < 0) → (x2 + y 2 < 0)),

where the domain for x and y consists of all integers, so that the negation sign ¬
appears after any quantifiers. Determine the truth values of the original statement
and of its negation.

29. Consider the statement S : ∀y∃x((P (x) → Q(y)) ∧ R(x, y)). For each of the following,
determine whether the expression is equivalent to S, the negation of S, or neither.

(a) ∀x∃y((P (y) → Q(x)) ∧ R(y, x))

(b) ∃y∀x((P (x) → ¬Q(y)) ∨ ¬R(x, y))
(c) ∃y∀x((P (x) ∧ ¬Q(y)) ∨ ¬R(x, y))

30. Prove that for any integers a and b, if a − b is odd, then a + b is odd also.

31. Prove that for any integers a, b, c, if ab does not divide c2 , then a does not divide c or
b does not divide c.

32. Let m, n ∈ Z. Prove the following statements using the contrapositive.

(a) If mn ̸= −1, then either (m ̸= 1 and n ̸= 1) or (m ̸= −1 and n ̸= −1).

(b) If m + n ≥ 2, then either m ≥ 1 or n ≥ 1.

33. The Intermediate Value Theorem from Calculus states that if f is a continuous function
on [a, b] and L is a number strictly between f (a) and f (b), then there is some value c
in (a, b) with f (c) = L. To prove this Theorem by contradiction, what assumption
should be made? (State “useful” assumptions; do not lead with a negation.)

34. Consider the claim “there is some number that is less than every other number,” where
we will specify which kind of numbers we are working with in later parts.

(a) Write this statement in symbolic form in terms of quantifiers.

(b) Suppose the universe of discourse for “numbers” consists of the positive integers.
Is the claim true? Prove it or disprove it.
(c) Suppose the universe of discourse for “numbers” consists of the nonnegative ra-
tional numbers. Is the claim true? Prove it or disprove it.
(d) Suppose the universe of discourse for “numbers” consists of the positive rational
numbers. Is the claim true? Prove it or disprove it.
(e) Suppose the universe of discourse for “numbers” consists of the nonnegative inte-
gers. Is the claim true? Prove it or disprove it.

35. Prove that not every integer is the sum of two squares.

36. Prove that if the integer n is the sum of two squares, then 4n is the sum of two squares.

37. Let n be an integer. Prove that if there is an integer k such that n = 4k + 3, then n is
not the sum of two squares.
38. Let a, b ∈ Z be nonzero. Prove that if a|b and a + b is odd, then a is odd.

39. Prove that if n is an integer, then n2 = 4k or n2 = 4k + 1 for some integer k.

40. Let n be an integer. Prove the given statement. n2 + 3 is divisible by 4 if and only if
n2 − 3 is divisible by 2.

41. Prove or disprove: there exist a, b ∈ Z such that a|b, b|a, and a ̸= b.

42. Prove that there exists a real number x such that x2 − 7 = 0.

43. Prove that for any integer n, n is even if and only if n3 + 1 is odd.

44. Let a, b, c ∈ Z. Prove that if a2 + b2 = c2 , then either a or b is even. Hint: Use the
identity (a + b)2 − c2 = a2 + b2 − c2 + 2ab.
√
45. Let x be positive. Prove that if x is an irrational number, then x is also irrational.

46. Determine whether

√ the following claim is true; justify your answer. If x is positive and
rational, then x is also rational.

47. Let m and n be integers. Prove that the following are equivalent:

i) Exactly one of m and n is even,

ii) m + n is odd,
iii) (m + n)2 is odd.

48. Prove that for all nonnegative real numbers x and y, the following inequality holds:
√
√ x2 + y 2
xy ≤ .
2

49. Prove that for all real numbers x and y, the following inequality holds:
√ √
x2 + y 2 4
4 x + y
4
≤ .
2 2

50. Determine whether the following statements are true or false:

(a) ∅ ⊆ ∅.
(b) ∅ ∈ {∅, {∅}}.
(c) ∅ ⊆ {∅}.
(d) The cardinality of {∅} is 0.
(e) The cardinality of ∅ is 0.
(f) For two sets A and B, it is always true that A × B ̸= B × A.
(g) Let A and B be sets whose elements lie in a given universe U . Then it is always
the case that A − B = B − A.
(h) For all sets A and B, A ∪ B = B ∪ A.
 (i) Let A be a nonempty set. There exists a function f : A → A such that f ◦ f = f .
(j) For any nonempty set S, there exists a surjective function from the power set
P(S) to S.
(k) For any two nonempty sets A and B, there exists a surjective function from A × B
to A.
(l) Every nonempty set has at least one proper subset.
(m) Let A, B, and C be nonempty sets. Then A × B × C = A × (B × C).
(n) For all sets A and B, A ∩ B = B ∩ A.
(o) If A and B are finite nonempty sets with |A| = m and |B| = n, then there are at
least n functions f : A → B.
(p) Let A and B be nonempty sets. There are always strictly more relations from A
to B than functions f : A → B, no matter what sets A and B are.
(q) To count how many elements are in A ∩ B, we first count how many elements are
in A and how many elements are in B, multiply these answers, and then subtract
the number of elements in A ∪ B, so that |A ∩ B| = |A| · |B| − |A ∪ B|.
(r) For non-empty sets A, B, C, if A ∩ B = ∅ and A ∩ C = ∅, then B ∩ C = ∅.
(s) Let A = {a, ∅} and B = {a}. Then P(A − B) = {∅}.
∪
∞
(t) Let An = [1 + n , 3 + n ) for each n ∈ Z . Then
1 1 +
An = (1, 3).
n=1

∩
∞
(u) Again let An = [1 + 1
n
,3 + 1
n
) for each n ∈ Z . Then
+
An = [2, 3]
n=1

51. Your instructor sets up a string of dominoes such that if one falls, the next one also
falls. He then pushes the first domino. What can you conclude about the remaining
dominoes?

52. Let A = {1, 2, 3, 4, 5} and B = {4, 5, 6, 7, 8}.

(a) What is |A × B|?

(b) Determine (A − B) ∪ (B − A).
(c) Determine (A − B) ∩ (B ∪ A) ∩ ∅.

53. Let A = {a, b, c} and B = {α, β}.

(a) Is B × A = A × B? Explain your reasoning.

(b) Find the cardinality of both A × B and its power set P(A × B).

54. Let A = {6, 7, 8, 9}, B = {3, 6, 9}, and C = {0, 2, 4, 6, 8}.

(a) Compute A ∪ B
(b) Compute A − C
(c) Compute P(B)
 (d) Let f : A → B be given by f (6) = 2, f (7) = 4, f (8) = 6, and f (9) = 8. Find a
left inverse g : B → A for the function f .

55. Let A = {1, 2, 3, 4, 5}, B = {0, 3, 6}, and C = {0, 8, 9}.

(a) Compute A ∩ C
(b) Compute B − A
(c) Compute B × C
(d) Let f : A → B be given by f (1) = 0, f (2) = 3, f (3) = 3, f (4) = 6, and f (5) = 0.
Find a right inverse g : B → A for the function f .
( )
56. Let f : R → R be given by f (x) = x2 − 2x. Find f [1, 3] .
( )
57. Let f : R → R be given by f (x) = x2 . Find f −1 [1, 4] .

58. Suppose P (0) ≡ T and P (n) → P (n + 2) and P (n) → P (n + 5). For which positive
integers is P (n) ≡ T?

59. Let A, B, C be sets in a common universal set U .

(a) Prove that (A ∩ B) ∪ (A ∩ B C ) = A.

(b) Prove that if A − B = B − A, then A = B.
(c) Determine (do not prove) whether the following statement is true or false: If
A ⊆ B, then A − B = ∅.
(d) Prove A ∩ (B − A) = ∅.
(e) Prove A ∪ (B − A) = A ∪ B.
(f) Prove (A ∪ B) ∩ (A ∪ B) = A.
(g) Prove A − (A − B) = A ∩ B.
(h) Prove (A − C) ∪ (B − C) ⊆ (A ∪ B) − C.
(i) Prove A − B = A ∪ B.
(j) Prove A ∩ A − B = A ∩ B.
(k) Let f : A → B, and let S, T ⊆ A. Prove that f (S) − f (T ) ⊆ f (S − T ).
∪
∞ ∩
∞
60. Let i ∈ N. For the following sets, determine Ai and Ai . Offer some justification.
i=1 i=1
[ ]
(a) Let Ai = − 1i , 1 + 2
i
, the set of all x ∈ R satisfying − 1i ≤ x ≤ 1 + 2i .
(b) Let Ai = {−i, −i + 1, · · · − 1, 0, 1, · · · , i − 1, i}, the set of all x ∈ Z satisfying
−i ≤ x ≤ i.
[ ] ∩
∞
61. Let n ∈ Z and define the intervals An =
+
− n1 , 1 + 2
n
. Find An .
n=1

62. Prove that 3n2 + n + 14 is even for all n ∈ Z.

63. Prove that n < 2n for all n ∈ N.

 ∑
n
1
64. Prove, using mathematical induction, that 3i−1 = (3n − 1) for all positive integers
i=1
2
n.

65. Prove that

1(1 + 1) 2(2 + 1) n(n + 1) n(n + 1)(n + 2)
+ + ··· + =
2 2 2 6
for all positive integers n.

66. Prove that

n(2n − 1)(2n + 1)
12 + 32 + 52 + · · · + (2n − 1)2 =
3
for all positive integers n.

67. For which positive integers n is 2n + 5 ≤ 2n ? Prove your answer using induction.
∑n
1 1
68. Prove that for every n ∈ Z , we have that
+
k
= 1 − n.
k=1
2 2

69. Let n ∈ Z+ . Develop a formula for the nth derivative of xn . Use mathematical induction
to prove your hypothesis.

70. Define a sequence by a1 = 1, a2 = 4, and for n ≥ 3, an = 2an−1 − an−2 . Show that for
all positive integers n, an = 3n − 2.

71. Suppose you have an infinite amount of money in your bank account and you wish to
withdraw at an ATM. However, the ATM only uses $2 bills and $5 bills. use strong
induction to prove that you are able to withdraw any amount of money (with no
change) where the minimum you can withdraw is $4.

72. Provide a counterexample to disprove ⌊x + y⌋ = ⌊x⌋ + ⌊y⌋ for all x, y ∈ R. What

condition would you change for this equality to hold?

73. Find the value of ⌊π + ⌈π⌉⌋.

⌊ ⌋
74. Find the value of − 12 · ⌊ 25 ⌋ .

75. Let L be the set of all non-vertical lines in the Cartesian plane. For each relation given
below, determine whether the relation is a function. Justify your choice.

(a) R1 = {(ℓ, m) ∈ L × R : line ℓ has slope m}.

(b) R2 = {(m, ℓ) ∈ R × L : line ℓ has slope m}.

76. Determine the truth value of the following statements.

2t
(a) g : R → [−1, 1] given by g(t) = is one-to-one.
+1 t2
(b) The function f : R × R → R given by f (m, n) = m sin(n) is injective.
(c) The function f : R × R → R given by f (m, n) = m sin(n) is surjective.
(d) The function f : Z × Z → Z given by f (m, n) = |n| is injective.
 (e) The function f : Z × Z → Z given by f (m, n) = |n| is surjective.
(f) The function f : Z × Z → Z given by f (m, n) = m2 − n2 is injective.
(g) The function f : Z × Z → Z given by f (m, n) = m2 − n2 is surjective.
(h) The function f : N → N given by f (x) = x2 is bijective.
(i) The function f (x) = 2x + 1 is a bijection from R to R.
(j) The function f (x) = x2 + 1 is a bijection from R to R.
(k) The function f (x) = x3 is a bijection from R to R.
(l) The function f (x) = (x2 + 1)(x2 + 2) is a bijection from R to R.
(m) The function f (x, y) = x − y is a bijection from R2 to R2 .

77. Given non-empty finite sets A and B with |A| = |B|, prove that a function f : A → B
is injective if and only if f is surjective.

78. Suppose that g is a function from A to B and f is a function from B to C.

(a) If f and g are one-one functions, then show f ◦ g is also one-one.

(b) Prove or disprove: If f ◦ g is one-one, then g is one-one.
(c) Prove or disprove: If f ◦ g is one-one, then f is one-one.

79. Let f : R → R by f (x) = 10 − 2x.

(a) What is f ◦ f ?
(b) Is f bijective? If so, write a formula for f −1 .

80. Let f : R2 → R be defined as follows: f (x, y) = e2x · e3y .

(a) Determine whether f is injective.

(b) Determine whether f is surjective.

81. Let A and B be two nonempty sets. Define the function ΠA : A × B → A by

ΠA ((a, b)) = a. Find, with proof, all sets B for which ΠA is injective.
Note: you should both prove those sets make ΠA injective, and any other set makes ΠA
not injective.

82. Let S be a nonempty set. Define the function u : P(S) × P(S) → P(S) by

u((A, B)) = A ∪ B for all pairs (A, B) ∈ P(S) × P(S).

Prove the following:

(a) The function u is surjective.

(b) The function u is not injective.

83. Prove that if n ∈ Z, then 2n2 + n + 1 is not divisible by 3.

84. Prove the following equality is true for all n ∈ Z+ using induction:
∑
n
n(n + 1)
(−1)j j 2 = (−1)n .
j=0
2

85. Use strong induction to prove that the following predicate P (n) is true for all integers
n ≥ 8:
P (n) = “∃a, b ∈ N such that n = 3a + 5b”.

86. Prove the following predicate is true for all integers n ≥ 30:

P (n) = “∃a, b ∈ N0 such that n = 4a + 11b”

using (a) a proof by induction with cases, and (b) a proof by strong induction.
87. A password is a string of 8 lowercase English letters.
(a) How many passwords are possible?
(b) How many passwords are possible if no letter is repeated?
(c) How many passwords are possible if the letters a and c appear exactly once (and
other letters may be repeated)?
88. How many ways are there to assign the three projects of literature review, simulation
programming, and paper writing to a group of six people, if everyone must be assigned
to exactly one project and each project must have two people working on it?
89. Suppose a state’s license plates consist of 3 letters A through Z and 4 digits 0 through
9 arranged in a seven-character string, with the first two characters required to be
letters and the sum of the four digits required to be congruent to 1 (mod 10). For
example, AB11A90 is a valid license plate. How many license plates are possible?
90. Suppose a state’s license plates consist of 4 letters A through Z and 3 digits 0 through
9 arranged in a seven-character string, with two additional requirements:
ˆ the license plate must not consist of alternating letters and numbers (such as
A1B2C3D)
ˆ the four letters, wherever they are in the string, must not spell out one of 50
banned four-letter words (for example, if the word “DUKE” is banned, D34UK2E
is not an allowed license plate).
For example, AA43B3C and 1A2B3CD are valid license plates. How many license
plates are possible?
91. Determine how many arrangements of all 26 letters of the alphabet there are that
contain either the word “RED” or the word “BLACK.”
92. How many functions are there from the set {1, 2, 3, 4, 5} to the set {−1, 0, 1}?
93. How many relations R are there from a set A with 5 elements to a set B with 4 elements
if we require that for each a ∈ A, there are exactly two distinct elements b1 and b2 of
B such that (a, b1 ) and (a, b2 ) are in R?
 94. A math professor writes a test with 20 questions.

(a) If each question is multiple choice with options A, B, C, and D, how many possible
test responses are there, assuming each question is answered?
(b) Suppose now that the first 15 questions are multiple choice and students are told
to answer at least 3 of the remaining 5 free response questions. Assuming all
students follow the directions, how many different possibilities are there for the
choice of questions that are answered?
(c) Suppose further that partial credit is awarded only in increments of whole points.
(So, each score is an integer between 0 and 100, inclusive.) How many students
must be in the class to guarantee that at least five have the same score? Explain.

95. How many integers n satisfying 1 ≤ n ≤ 100 are divisible by 2 or 5?

96. Determine which unique x ∈ [0, 14) solves 3x ≡ 4 (mod 14).

97. Determine whether each statement below is true or false.

(a) For any pair of positive integers (a, b), gcd(a, b) lcm(a, b) = ab.
(b) Suppose in solving a counting problem trying to find |A| for some set A, we got
an answer of n but know that there are two subsets B ⊆ A and C ⊆ A such that
we counted every element of B twice and every element of C exactly three times,
but every other element was counted only once. Then |A| = n − |B| − 2|C|.

98. Give a proof that there are infinitely many prime numbers.

99. What is the remainder when 1234 · 5678 is divided by 5?

100. What is the remainder when 1234 · 567890 is divided by 3?

101. Let n ∈ Z. Prove the following properties.

(a) If n is odd, then n2 ≡ 1 (mod 8).

(b) Either n2 ≡ 1 (mod 4) or n2 ≡ 0 (mod 4).
(c) If 4 divides n, then n2 ≡ 0 (mod 16).

102. Suppose two numbers a, b ∈ Z satisfy

ab = 27 38 52 711 and gcd(a, b) = 23 34 51 .

Determine lcm(a, b).

103. Consider Z13 = {0, 1, 2, · · · , 12}. Compute the following.

(a) 7 +13 6
(b) 12 +13 12
(c) 2 ·13 9
(d) 7 ·13 3
104. Suppose n, m ∈ Z+ such that n, m > 1 and that n|m. Prove that if a, b ∈ Z such that
a ≡ b (mod m), then a ≡ b (mod n).

105. Find a prime number p such that p ≡ 4 (mod 5).

106. Prove there are infinitely many prime numbers not congruent to 1 (mod 5).

107. Use the Euclidean Algorithm to find gcd(156, 101).

108. Now that you’ve computed gcd(156, 101), find the Bézout coefficients of 156 and 101.
That is, find x, y ∈ Z such that gcd(156, 101) = x · 156 + y · 101.

109. Use the Euclidean Algorithm to determine gcd(461, 379).

(a) Use your previous work to determine the value of 379−1 in Z461 .
(b) Determine integer values p and q that solve the equation 461p + 379q = 9.

110. Let x, y ∈ Zn with n ≥ 2. Determine whether the given statement is true or false.
Explain your answer.

(a) If x and y are each invertible in Zn , then x + y is invertible in Zn .

(b) If x and y are each invertible in Zn , then x · y is invertible in Zn .

111. How many ways are there to select a first-prize winner, a second-prize winner, and a
third-prize winner from a group of 50 participants?

112. Consider sets A, B, C. Let C = A ∪ B with |A| = 36, |B| = 120, and |A ∩ B| = 20.

(a) Determine the cardinality of the power set of C.

(b) Determine the total number of surjective functions from A to B.
(c) Determine the total number of injective functions from A ∩ B to A.

113. Let Rm be a relation on Z such that (a, b) ∈ Rm if and only if

a5 ≡ b5 (mod m).

(a) When m ∈ Z+ −{1}, prove or disprove that Rm ⊂ Z×Z is an equivalence relation.

(b) If m = 1, R1 is an equivalence relation. Fully describe [0]R1 .
(c) Fully describe [1]R1 .

114. Let R be the relation on A = {1, 2, 3, 4, 5, 6} given by x R y iff x = y + 1 or x = y − 1.

Determine, with appropriate justification, whether R is reflexive and whether R is
symmetric.

115. True or false: the relation ≤ on Z and the relation ⊆ on P({1, 2, 3}) are both reflexive
and transitive.

116. Let R be a relation on {college students} such that we say (a, b) ∈ R if and only if
person a and b attend the same college. Assuming you can only attend one college at
a time, is R an equivalence relation?
117. Consider the following relations on R:
R1 = {(a, b) ∈ R × R : a > b} and R2 = {(a, b) ∈ R × R : a = b}.
(a) Find the composition R1 ◦ R1 .
(b) Find the union R1 ∪ R2 .
118. Determine the truth value of the following statements. No justification is required. For
1 ≤ j ≤ 3, let each set Rj be a relation on Z.
R1 = {(a, b) : a = b or a = −b}
R2 = {(a, b) : b = ak for some k ∈ Z}
R3 = {(a, b) : a − b = 5k for some k ∈ Z}.
(a) The relation R1 is an equivalence relation.
(b) The relation R2 is an equivalence relation.
(c) The relation R3 is an equivalence relation.
(d) The cardinality (size) of [2]R1 is finite.
(e) The cardinality (size) of [2]R3 is finite.
119. Let n ∈ Z+ be fixed and define the relation
R = {(x, y) ∈ Z+ × Z+ : lcm(x, n) = lcm(y, n)}.
Prove that R is an equivalence relation on Z+ .
120. Determine whether the following relations R on the set of all real numbers are reflexive,
symmetric, and/or transitive, where (x, y) ∈ R if and only if
(a) x − y is an integer.
(b) |x − y| < 10.
(c) x ≤ y
121. Consider the relation R on the set R2 of points on the Cartesian plane defined by
(a, b)R(c, d) if and only if (a + b) = (c + d).
(a) Prove that R is an equivalence relation.
(b) Let m be a real number, and consider the point (0, b) ∈ R2 . Give a geometric
description of the equivalence class [(0, b)] containing this point.
122. Consider the relation R on the set R2 − {(0, 0)} of points in the Cartesian plane other
than the origin defined by (a, b)R(c, d) if and only if there exists a nonzero real number
k such that (c, d) = (ka, kb).
(a) Prove that R is an equivalence relation.
(b) Let m be a real number, and consider the point (1, m) ∈ R2 . Give a geometric
description of the equivalence class [(1, m)] containing this point.
123. Let R be the equivalence relation on length 5 bit strings where (b, c) ∈ R if b and c
have the same number of 1s. Write out the equivalence class of the string 01101.