Assignment 1
Assignment 1
Assignment 1
Muhammad Arabi
June 14, 2021
1. a. Proof Method: Since this is a universal statement, counterexample is used to disprove it.
Claim: False, It is not the case that for any positive integer n, 4n + 5 or 4n + 5 is divisible by 9.
Assumption: n is a positive integer.
To prove this statement is false We must first define a positive integer and provide a definition of divisibility.
Second, we use the definition of integer divisibility by professor Talbert which is as following: A nonzero integer
m divides an integer n provided that there is an integer q such that n = mq. Using definitions of integer and
divisibility, the following counter-example proves the claim true.
1
’or’ part of the claim holds. Since we have established that x is a rational number, using the property of rational
numbers closed under multiplication used in part (d) we re-write x3 as x · x2 = a/b · a2 /b2 . We can conclude that
the second part of the conclusion does not hold. However, our claim is holds since we the first part of conclusion
was proven true. Therefore, the original statement is true.
Aside: The original statement has a false hypothesis, however the conclusion is true which makes the statement
true as per the truth table covered in the first week of this course.