November 19th, 2021 Mastery Opportunity Assessment #7 Discrete Structures

Instructions: You may use your notes, Content Prep assignments, Class Activities, and resources
on our Canvas course, but help from other people (e.g., students, tutors, etc.) and unspecified
electronic aids are not allowed (e.g., Chegg, Bartleby). All assessments are to be submitted as a
single PDF file for each learning target through Canvas prior to the end of the course meeting.
No assessments will be accepted ≥ 10 minutes after this deadline.
Core Learning Targets
1. (LT: C1) Use truth tables to determine whether or not the following two statements are
logically equivalent.
p∨ ∼ q and ∼ (∼ p ∧ q)

2. (LT: C2) Write the negation of the following statement in English:

x
If x is rational, then 3 is rational and 3x is rational.
3. (LT: C3) Write the formal negation for the statement below in English:
For every person in this class, there is at least one thing they will buy on Black Friday.
4. (LT: C4) Give a formal proof of the statement below using only definitions and algebra:
For all real numbers x and y, if x, y ∈ Q, then 2xy ∈ Q.
5. (LT: C5) Disprove the following statement by providing and formally justifying a counterex-
ample (using complete sentences):
If x, y ∈ Z+ , then xy > x.
6. (LT: C6) Use Mathematical Induction to prove the following formula for all integers n ≥ 1:
X
n
(4i − 1) = n(2n + 1).
i=1

7. (LT: C7) Write the first four terms of the recursively defined sequence:
a0 = 2
an = (−1)n an−1 for n ≥ 1.

8. (LT: C8) Let a0 , a1 , a2 , . . . be defined by the formula an = 3 · 2n for every integer n ≥ 0.

Justify that the formula satisfies the following recursion:
an = 2 · an−1

9. (LT: C9) Represent the following set in roster notation:

{x ∈ Z− | x3 + 2x2 − 8x = 0}

10. (LT: C10) Consider the following two sets:

X = {n ∈ Z | n = 3x+15y, for some x, y ∈ Z} Y = {m ∈ Z | m = 6x−9y, for some x, y ∈ Z}
Prove Y ⊆ X.
SUPPLEMENTAL LEARNING TARGETS ON NEXT PAGE

Page 1 of 3
November 19th, 2021 Mastery Opportunity Assessment #7 Discrete Structures

Supplemental Learning Targets Learning Targets

11. (LT: S1) Consider the following statements:

A: Thursday is a holiday.
B: I don’t have work on Thursday.
C: There is school on Thursday.

Write the statement “Thursday is a holiday and there is no school, but I have work that day.”
in symbols.

12. (LT: S2) Write the argument below in its symbolic form and determine if the argument
is valid or invalid. If it is valid, identify the rule of inference that guarantees its validity.
Otherwise, state which error is made.

If today is Friday, then I will sleep in tomorrow.

I will sleep in tomorrow.
∴ today is Friday.

13. (LT: S3) Construct the input-output table for the circuit below.

14. (LT: S4) Rewrite the following statement using ONLY symbols, ∀, ∃, the phrase “such that”,
and variables.

There is no smallest negative integer.

15. (LT: S5) State whether the argument is valid or invalid. Justify your answer by citing
universal modus ponens, universal modus tollens, converse error, or inverse error.

If x is rational,
√ then x ∈ R.
√3 6∈ Q.
∴ 3 6∈ R.

16. (LT: S6) Let x be an integer, justify that x divides x2 − 2x. No formal proof needed.

17. (LT: S7)

Fact 1: If x 6∈ Q and z ∈ Z+ , then xz 6∈ Q. Fact 2: If x 6∈ Q and y ∈ Z, then xy 6∈ Q.

Use only the facts above (no definitions needed) to give a formal proof that if x is irrational,
then 3x
2 is irrational.

Page 2 of 3
 November 19th, 2021 Mastery Opportunity Assessment #7 Discrete Structures

18. (LT: S8) Find the mistake in the “proof” below that the sum of two even integers is even:

Proof. Let m, n ∈ Z and suppose m and n are even. By definition of even,

m = 2k and n = 2j

for any k, j ∈ Z. Notice that

m + n = 2k + 2j
= 2(k + j).

Since k, j are any integers, and integers are closed under addition then k + j is any integer.
Therefore by definition of even, m + n is even.

19. (LT: S9) Compute the summation below.

X
2
(3k − 4)k+1
k=2

20. (LT: S10) Suppose a1 , a2 , a3 , . . . is a sequence defined as follows:

a1 = 5, a2 = 25
an = −3an−1 + 50an−2 for each integer n ≥ 3

Use strong induction to prove that an = 5n for every integer n ≥ 1.

21. (LT: S11) Use the method of iteration to guess an explicit formula for the sequence below:

a1 = 2 and an = 3 + 2 · an−1 for all n ≥ 2

Page 3 of 3

Powered by TCPDF (www.tcpdf.org)