Solutions for Crowdmark Homework Assignments 1 through 12

Crowdmark Daily Homework #1

Question 1: Decide whether or not the following are statements. In the case of a statement,
say if it is true or false, if possible.

(a) Are you majoring in mathematics?

This is a question and therefore is not a statement.

(b) He is six feet tall.

This is not a statement since there is no reference to who he is.

(c) 𝜋 is an irrational number.

This is a statement and since 𝜋 is an irrational number, the statement is true.

(d) The moon is made of green cheese.

This is a statement and since the moon is not made of green cheese, the statement is
false.

(e) Go ahead, make my day!

This is not a statement since you cannot determine if it is definitely true or definitely
false.

Crowdmark Daily Homework #2

Express each statement or open sentence in a symbolic form such as 𝑃⋀𝑄, 𝑃⋁𝑄,
𝑃⋁(~𝑄) or (~𝑃), etc. Be sure to also state exactly what statements 𝑃 and 𝑄 stand for.

(a) The number 8 is both even and a power of 2.

Let 𝑃 be the number 8 is even and 𝑄 be the number 8 is a power of 2. Then the above
statement can be expressed as 𝑃⋀𝑄.

(b) There is a quiz scheduled for Wednesday or Friday.

Let 𝑃 be there is a quiz scheduled for Wednesday and 𝑄 be there is a quiz scheduled
for Friday. Then the above open sentence can be expressed as 𝑃⋁𝑄.
 (c) The matrix A is not invertible.

Let 𝑃 be the matrix is invertible. Then the above open statement can be expressed
as ~𝑃.

(d) At least one of the numbers x and y equals 0.

Let 𝑃 be the number x equals 0 and 𝑄 be the number y equals 0. Then the above
open statement can be expressed in the form of 𝑃⋁𝑄.

(e) The number x equals zero, but the number y does not.

Let 𝑃 be the number 𝑥 equals zero and 𝑄 be the number 𝑦 equals zero. Then the
above open statement can be expressed in the form of 𝑃⋀(~𝑄).

Crowdmark Daily Homework #3

Without changing their meanings, convert each of the following sentences into a sentence
having the form “If 𝑃, then 𝑄.”

(a) A matrix is invertible provided that its determinant is not zero.

If the determinant of a matrix 𝐴 is not zero, then the 𝐴 is invertible.

(b) For a function to be continuous, it is necessary that it is integrable.

If the function is continuous, then it is integrable.

(c) The discriminant is negative only if the quadratic equation has no real solutions.

If the discriminant of a quadratic equation is negative, then the quadratic equation

has no real solutions.

(d) A series converges whenever it converges absolutely.

If the series converges absolutely then the series converges.

(e) For a function to be continuous, it is suVicient that it is diVerentiable.

If a function is diVerentiable then it is continuous.

Crowdmark Daily Homework #4

Without changing their meanings, convert each of the following sentences into a sentence
having the form “𝑃 if and only if 𝑄.”

(a) For matrix 𝐴 to be invertible, it is necessary and suVicient that det(𝐴) ≠ 0.

The matrix 𝐴 to be invertible if and only if the det(𝐴) ≠ 0.

(b) If a function has a constant derivative, then it is linear, and conversely.

A function has a constant derivative if and only if it is linear.

(c) If 𝑥 ⋅ 𝑦 = 0 then 𝑥 = 0 or 𝑦 = 0, and conversely.

𝑥 ⋅ 𝑦 = 0 if and only if 𝑥 = 0 or 𝑦 = 0.

(d) If 𝑎 ∈ ℚ then 5𝑎 ∈ ℚ, and if 5𝑎 ∈ ℚ then 𝑎 ∈ ℚ.

𝑎 ∈ ℚ if and only if 5𝑎 ∈ ℚ.

Crowdmark Daily Homework #5

1. Write a truth table for the logical statements for 𝑃 ⋁ (𝑄 ⋀(~𝑅)).

P Q R ~R 𝑄 ⋀ (~𝑅) P ⋁(𝑄 ⋀ (~𝑅))

T T T F F T
T T F T T T
T F T F F T
T F F T F T
F T T F F F
F T F T T T
F F T F F F
F F F T F F

2. Suppose the statement ;(𝑃⋀𝑄)⋁𝑅< ⟹ (𝑅⋁𝑆) is false. Find the truth values of
𝑃, 𝑄, 𝑅 and 𝑆. (This can be done without a truth table.)

Since the conditional implication is false, we know (𝑃⋀𝑄)⋁𝑅 must be true, while
𝑅⋁𝑆 is false due to the truth table for the conditional implication. Since 𝑅⋁𝑆, we
know that both 𝑅 and 𝑆 must be false. Now we can see that (𝑃⋀𝑄)⋁𝑅 = (𝑃⋀𝑄)⋁𝐹.
 Since (𝑃⋀𝑄)⋁𝑅 is true, we obtain that 𝑃⋀𝑄 must be true. Hence both 𝑃 and 𝑄 is
true. Therefore, both 𝑅 and 𝑆 is false, and both 𝑃 and 𝑄 is true.

Crowdmark Daily Homework #6

1. Use truth tables to show that

𝑃 ⟹ 𝑄 ≡ (𝑃 ⋀ ∼ 𝑄) ⟹ (𝑄 ⋀ ∼ 𝑄).

Make sure you show all steps in the truth table.

Let S be the logical statement (𝑃 ⋀ ∼ 𝑄) ⟹ (𝑄 ⋀ ∼ 𝑄). Then we have the

following truth table.

𝑃 𝑄 ~𝑄 𝑃 ⟹ 𝑄 𝑃⋀∼ 𝑄 𝑄⋀∼ 𝑄 𝑆
T T F T F F T
T F T F T F F
F T F T F F T
F F T T F F T

Since the fourth and seventh column have the same truth values for all
combinations of truth values for P and Q, we conclude that 𝑃 ⟹ 𝑄 is logically
equivalent to (𝑃 ⋀ ∼ 𝑄) ⟹ (𝑄 ⋀ ∼ 𝑄).

2. Decide whether or not the following pairs of statements are logically equivalent:

𝑃 ⋁(𝑄 ⋀ 𝑅) and (𝑃 ⋁ 𝑄) ⋀ 𝑅.

𝑃 𝑄 𝑅 𝑃⋁𝑄 𝑄⋀𝑅 𝑃 ⋁(𝑄 ⋀ 𝑅) (𝑃 ⋁ 𝑄) ⋀ 𝑅

T T T T T T T
T T F T F T F
T F T T F T T
T F F T F T F
F T T T T T T
F T F T F F F
F F T F F F F
F F F F F F F

We see that they are not logically equivalent since the sixth and seventh columns do
not have the same truth tables.
Crowdmark Daily Homework #7

1. Write the statement

∀ 𝑥 ∈ ℝ, ∃ 𝑛 ∈ ℕ, 𝑥 ! ≥ 0.

as an English sentence. Say whether they are true or false.

For all real numbers 𝑥, there exists a natural number 𝑛 such that 𝑥 ! ≥ 0.

2. Write the statement

∃ 𝑎 ∈ ℝ, ∀ 𝑥 ∈ ℝ, 𝑎𝑥 = 𝑥.

as an English sentence. Say whether they are true or false.

There is a real number 𝑎 such that 𝑎𝑥 = 𝑥 for every real number 𝑥.

3. Write the statement

∃ 𝑛 ∈ ℕ, ∀ 𝑋 ∈ 𝒫(ℕ), |𝑋 | < 𝑛

as an English sentence. Say whether they are true or false. Note: 𝒫(ℕ) is another
notation for the powerset of ℕ.

There is a natural number 𝑛 such that for every subset 𝑋 of the power set on the
natural numbers, the number of elements in 𝑋 is less than 𝑛.

4. Write the statement

∀ 𝑛 ∈ ℤ, ∃ 𝑚 ∈ ℤ, 𝑚 = 𝑛 + 5.

as an English sentence. Say whether they are true or false. What is the truth value if
the quantifiers are reversed?

For every integer 𝑛, there is an integer 𝑚 such that 𝑚 = 𝑛 + 5.

Crowdmark Daily Homework #8

1. Translate each of the following sentence into symbolic logic.

"If 𝑓 is a polynomial and its degree is greater than 2, then 𝑓′ is not constant."
 Be sure to label your statements in your symbolic logic statement with letters
(preferably with P, Q, R, S, T, ...). Use logical connectives as needed.

Let 𝑃 be 𝑓 is a polynomial, 𝑄 be the degree of 𝑓 is greater than 2, and 𝑅 be 𝑓′ is not

constant.

Then the symbolic for the above statement is (𝑃 ∧ 𝑄) ⟹ 𝑅.

2. Translate each of the following sentence into symbolic logic.

"For every positive number 𝜖 there is a positive number 𝑀 for which |𝑓(𝑥) − 𝑏| < 𝜖,
whenever 𝑥 > 𝑀."

Be sure to label your statements in your symbolic logic statement with letters
(preferably with P, Q, R, S, T, ...). Use logical connectives as needed.

(∀ 𝜖 > 0)(∃𝑀 > 0)(𝑥 > 𝑀 ⟹ |𝑓(𝑥) − 𝑏| < 𝜖).

3. Translate each of the following sentence into symbolic logic.

"There exists a real number 𝑎 for which 𝑎 + 𝑥 = 𝑥 for every real number 𝑥."

Be sure to label your statements in your symbolic logic statement with letters
(preferably with P, Q, R, S, T, ...). Use logical connectives as needed.

(∃𝑎 ∈ ℝ)(∀𝑥 ∈ ℝ)(𝑎 + 𝑥 = 𝑥).

4. Translate each of the following sentence into symbolic logic.

"If 𝑥 is a rational number and 𝑥 ≠ 0, then tan 𝑥 is not a rational number."

Be sure to label your statements in your symbolic logic statement with letters
(preferably with P, Q, R, S, T, ...). Use logical connectives as needed.

;(𝑥 ∈ ℚ) ∧ (𝑥 ≠ 0)< ⟹ tan 𝑥 ∉ ℚ.

Crowdmark Daily Homework #9

For each of the sentences below, write down a sentence that is the negation of the given
sentence. To accomplish this, you may want to write the sentence in symbolic logic, negate
it, and then translate it back to an English sentence to express your negation of the given
sentence. You will be graded on the negation as an English sentence.

1. Negate the sentence:

 The number 𝑥 is positive, but the number 𝑦 is not positive.

Let 𝑃 be the number 𝑥 is positive and 𝑄 be the number 𝑦 is positive. Then the above
statement is 𝑃 ∧ (~𝑄). Thus, ~;𝑃 ∧ (~𝑄)< ≡ ~𝑃 ∨ 𝑄. Therefore, we can write the
negation of the above sentence as “the number 𝑥 is not positive or the number y is
positive.”

2. Negate the sentence:

For every positive number 𝜖, there is a positive number 𝛿 such that |𝑥 − 𝑎| < 𝛿
implies |𝑓(𝑥) − 𝑓(𝑎)| < 𝜖.

We write the above statement in symbolic logic as

(∀𝜖 > 0)(∃𝛿 > 0)(|𝑥 − 𝑎| < 𝛿 ⟹ |𝑓(𝑥) − 𝑓(𝑎) < 𝜖).

Now we find the negation in symbolic logic notation.

~[(∀𝜖 > 0)(∃𝛿 > 0)(|𝑥 − 𝑎| < 𝛿 ⟹ |𝑓(𝑥) − 𝑓(𝑎)| < 𝜖)]
≡ (∃𝜖 > 0)(∀𝛿 > 0)((|𝑥 − 𝑎| < 𝛿) ∧ (|𝑓(𝑥) − 𝑓(𝑎)| > 𝜖).

Therefore, the negation of the above statement is

There is a positive number 𝜖 such that for every 𝛿 > 0, |𝑥 − 𝑎| < 𝛿 and
|𝑓(𝑥) − 𝑓(𝑎)| > 𝜖.

3. Negate the sentence:

There exists a real number 𝑎 for which 𝑎 + 𝑥 = 𝑥 for every real number 𝑥.

We write the above statement in symbolic logic as

(∃𝑎 ∈ ℝ)(∀𝑥 ∈ ℝ)(𝑎 + 𝑥 = 𝑥).

The negation of this quantified statement is

~[(∃𝑎 ∈ ℝ)(∀𝑥 ∈ ℝ)(𝑎 + 𝑥 = 𝑥)] ≡ (∀𝑎 ∈ ℝ)(∃𝑥 ∈ ℝ)(𝑎 + 𝑥 ≠ 𝑥).

Thus, the negation of the above quantified statement is

“for all real numbers 𝑎, there is a real number 𝑥 such that 𝑎 + 𝑥 ≠ 𝑥.

 4. Negate the sentence:

If 𝑥 is a rational number and 𝑥 ≠ 0, then 𝑡𝑎𝑛(𝑥) is not a rational number.

Let 𝑃 be 𝑥 is a rational number, 𝑄 be 𝑥 = 0, and 𝑅 be tan 𝑥 ∉ ℚ.

Then the above statement can be expressed as 𝑃 ∧ (~𝑄) ⟹ 𝑅.

We then can negate the symbolic expression by

~[𝑃 ∧ (~𝑄) ⟹ 𝑅] ≡ ~;𝑃 ∧ (~𝑄)< ∧ 𝑅 ≡ (~𝑃 ∨ 𝑄) ∧ 𝑅.

Therefore, we have the negation of the above statement is 𝑥 is not a rational number
or 𝑥 = 0, and tan 𝑥 is not a rational number.

Crowdmark Daily Homework #10

1. Prove the following statement using a direct proof.

If 𝑥 and 𝑦 are odd integers, then 3𝑥𝑦 is an odd integer.

Your proof should provide justification for each inference in the proof. See examples
done in class.

Proof: Assume that 𝑥 and 𝑦 are odd integers. By definition of odd integers there
exists integers 𝑚 and 𝑛, such that 𝑥 = 2𝑚 + 1 and 𝑦 = 2𝑛 + 1. Computing 3𝑥𝑦 we
have
3𝑥𝑦 = 3(2𝑚 + 1)(2𝑛 + 1) = 2(6𝑚𝑛 + 3𝑚 + 3𝑛 + 1) + 1.

Since 𝑚 and 𝑛 are integers then 6𝑚𝑛 + 3𝑚 + 3𝑛 + 1 is also an integer by Fact 4.1.
Thus, we can write 3𝑥𝑦 = 2𝑘 + 1, where 𝑘 is the integer 6𝑚𝑛 + 3𝑚 + 3𝑛 + 1. By the
definition of an odd integer, 3𝑥𝑦 is odd.
∎

2. Prove the following statement using a direct proof.

Let 𝑎, 𝑏, 𝑥, and 𝑦 be integers. If 𝑎|𝑥 and 𝑏|𝑦 then (𝑎𝑏)|(2𝑥𝑦).

Your proof should provide justification for each inference in the proof. See examples
done in class.

Proof: Suppose 𝑎, 𝑏, 𝑥, and 𝑦 be integers, 𝑎|𝑥 and 𝑏|𝑦. By definition of divides, there
exists integers 𝑝 and 𝑞 such that 𝑥 = 𝑝𝑎 and 𝑦 = 𝑞𝑏. We see that 2𝑥𝑦 = 2(𝑝𝑎)(𝑞𝑏).
By the associativity and commutativity properties for real numbers with
multiplication we can reorder things to 2𝑥𝑦 = (𝑎𝑏)(2𝑝𝑞). Since 2, 𝑝, and 𝑞 are
 integers, 2𝑝𝑞 is also an integer by Fact 4.1. Hence, we can write that 2𝑥𝑦 = (𝑎𝑏)𝑟
where 𝑟 is the integer 2𝑝𝑞. By the definition of divides, (𝑎𝑏)|(2𝑥𝑦).
∎
Crowdmark Daily Homework #11

1. Using a direct proof, prove that

For integers 𝑎 and 𝑏, if 𝑎 − 𝑏 is an odd integer, then 𝑎 + 𝑏 is also an odd integer.

Your proof should use the guidelines for good mathematical writing that I posted to
e-campus and how we have discussed writing proofs in class.

Proof: Let 𝑎 and 𝑏 be integers and assume that 𝑎 − 𝑏 is an odd integer. Then, by
definition of an odd integer, there is an integer 𝑧 such that 𝑎 − 𝑏 = 2𝑧 + 1. Now, we
see that 𝑎 + 𝑏 = 𝑎 − 𝑏 + 2𝑏 = 2𝑧 + 1 + 2𝑏 = 2(𝑧 + 𝑏) + 1. Since 𝑧 and 𝑏 are
integers, 𝑧 + 𝑏 is also an integer by Fact 4.1. Hence, 𝑎 − 𝑏 = 2𝑙 + 1 where 𝑙 is the
integer 𝑧 + 𝑏. By definition of an odd integer, 𝑎 + 𝑏 is odd.
∎

2. Using a direct proof, prove that

For positive integers 𝑎, 𝑏, and 𝑐, if 𝑎𝑐 divides 𝑏𝑐, then 𝑎 divides 𝑏.

Your proof should use the guidelines for good mathematical writing that I posted to
e-campus and how we have discussed writing proofs in class.

Proof: Assume that 𝑎, 𝑏, and 𝑐 are positive integers and (𝑎𝑐)|(𝑏𝑐). By the definition
of divides, there exists an integer 𝑑 such that 𝑏𝑐 = (𝑎𝑐)𝑑. We can use the
associative property to reorder the integers on the right to obtain 𝑏𝑐 = (𝑎𝑑)𝑐. Now
since 𝑐 is a positive integer, we can divide by 𝑐 on both sides to arrive at 𝑏 = 𝑎𝑑.
Therefore, by the definition of divides, 𝑎|𝑏.
∎
Crowdmark Daily Homework #12

1. A student in another introduction to proof class has proved the following statement.

Statement: Suppose 𝑚 is an integer. If 𝑚" is an odd integer, then 𝑚 is an odd

integer.

Grade the following proof shown below with the following grading scale.

A (correct): If the proof is correct, even if the proof is not the simplest or the proof
you would have given.
 C (partially correct): If the proof is largely correct. The proof may contain one or two
incorrect statements or justifications, but the errors are easily correctable.

F (failure): if the main idea of the proof is incorrect, or there are too many errors.

You should provide justification for a grade of C or F, and explain what is incorrect
and why. It is not necessary to write a correct proof, but you can if you want.

Proof: Assume 𝑚 is an odd integer. Then 𝑚 = 2𝑘 + 1 for some integer 𝑘. Thus, 𝑚" =
(2𝑘 + 1)" = 2(2𝑘 " + 2𝑘) + 1, which is odd. Therefore, if 𝑚" is odd then 𝑚 is odd.
∎

The student earns a grade of F since they started the proof with assuming the
conclusion and showed that the hypothesis is true. That is, they proved 𝑄 ⟹ 𝑃
instead of the given statement 𝑃 ⟹ 𝑄. Their proof is not correct.

2. A student in another introduction to proof class has proved the following statement.

Statement: Suppose 𝑎, 𝑏, and 𝑐 are integers. If 𝑎 divides 𝑏 and 𝑎 divides 𝑐, then

𝑎 divides 𝑏 + 𝑐.

Grade the following proof shown below with the following grading scale.

A (correct): If the proof is correct, even if the proof is not the simplest or the proof
you would have given.

C (partially correct): If the proof is largely correct. The proof may contain one or two
incorrect statements or justifications, but the errors are easily correctable.

F (failure): if the main idea of the proof is incorrect, or there are too many errors.

You should provide justification for a grade of C or F, and explain what is incorrect
and why. It is not necessary to write a correct proof, but you can if you want.

Proof: Suppose 𝑎 divides 𝑏 and 𝑎 divides 𝑐. Then for some integer 𝑞, 𝑏 = 𝑎𝑞, and for
some integer 𝑞, 𝑐 = 𝑎𝑞. Then 𝑏 + 𝑐 = 𝑎𝑞 + 𝑎𝑞 = 2𝑎𝑞 = 𝑎(2𝑞). So, 𝑎 divides 𝑏 + 𝑐.
∎
The student earns a grade of C since the proof is partially correct, but they use the
same letter 𝑞 for 𝑎 divides 𝑏 and 𝑎 divides 𝑐. They should have used a diVerent letter
for 𝑎 divides 𝑐.

Now each of these proofs do not state what definition they are using nor argue why
2𝑘 " + 2𝑘 and 2𝑞 are integers by Fact 4.1, but these would be minor issues with the
proofs, as is the proof of question 2 not inserting that 𝑎, 𝑏, and 𝑐 are integers.