Multiple Choice
Write an equivalent sentence for the statement.
-An number n is divisible by 3 if and only if the sum of the digits of n is divisible by 3. (Hint: Use The fact that (p → q) ∧ (q → p) is equivalent to p ↔ q.)
A) The sum of the digits of n is divisible by 3 or the number n is divisible by 3.
B) If a number n is divisible by 3 then the sum of the digits of n is divisible by 3, and if the sum of the digits of n is divisible by 3 then the number n is divisible by 3.
C) If a number n is divisible by 3 then the sum of the digits of n is divisible by 3, or if the sum of the digits of n is divisible by 3 then the number n is divisible by 3.
D) A number n is divisible by 3 and the sum of the digits of n is divisible by 3.
Correct Answer:

Verified
Correct Answer:
Verified
Q191: Convert the compound statement into words.<br>-
Q192: Use DeMorganʹs laws or a truth
Q193: Indicate whether the statement is a
Q194: Determine whether the statement is a
Q195: Construct a truth table for the
Q196: Indicate whether the statement is a
Q197: Identify the standard form of the argument.<br>- <span class="ql-formula" data-value="\begin{array} { l
Q198: Write the compound statement in symbols.<br>Let
Q199: Construct a truth table for the
Q200: Given p is true, q is