(B) 1 (C) There is so countes-example (D) We would not use a counter example in
ID: 3196882 • Letter: #
Question
(B) 1 (C) There is so countes-example (D) We would not use a counter example in this case 6. Ifaand b are two integers such that |b, tben ble. (A) = 2.5 = 2 (B) = 2, b = 4 (C) There is no counter-example (D) We would not use a counter example in this case 7·3' e Z such that _1=0 (A) I (B) n=2 (C) There is no counter-example (D) We would not use a counter example in this case 8. Every prime number is odd (A)a= 11 (B) R-2 (C) There is no counstes-example. (D) We would not use a counter example in this case. 9. Consider the statement Ifm is odd, then is even. Suppose you are trying to disprove this statement by dinect appeoah. The stractue of the proof shoald be (A) Suppose n is odd and deduce that a2 is even. (B) Suppose n2 is even and deduce n is odd. (C) Suppose n2 is odd and derwe n is even. (D) Produce n such that is odd and isodd. 10. Consider the statement lfm is divisible 13. then tu is divisible by 9. Which of the folowing is tree about this statement (A) This statement is true. (B) This statement is false.Explanation / Answer
6) A
If a|b, then b|a if and only if a = b
7) A
n = 1 statisfies the n2-1 = 0
i.e. 12-1 = 1 - 1 = 0
8) B
n = 2 is the only prime which is even
9) D
for, n = 3 odd
n2 = 9, is also odd
10) B
Take n = 6
n is divisible by 3 but not divisible by 9
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.