Assignment 1

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

Math 1200 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.

Let n = 2 where 2 is a positive integer. Then 4(2) + 5 = 13 which is not divisible by 9.


Let n = 2 where 2 is a positive integer. Then 42 + 5 = 23 which is not divisible by 9.

b. Proof Method: direct proof and proof by cases.


Claim: True, for any integers a1 , a2 , a3 if a1 + a2 + a3 is an even integer, there exists a positive integer j ≤ 3 such
that is aj even.
Assumption: a1 + a2 + a3 = 2n is an even integer denoted by 2n where n is also a positive integer.
According to the closed under addition and multiplication property of integers, we let 2n = f + g where f and g
are even are positive, To show our claim is true we use two cases:
Case 1: Suppose f = (2q + 1) + (2q + 1) where q is a positive integer and 2q + 1 is an odd integer then
2n = (2q + 1) + (2q + 1) + g = 2(2q + 1) + g.
Case 2: Suppose f = 2q + 2q where q is a positive integer and 2q is an even integer then 2n = 4q + g
if a1 = 2q or a1 = 2q + 1, a2 = 2q or a2 = 2q + 1 and a3 = g then our claim holds because at least one of there
three integers from either case is even. Note that had we let g be an odd integer then the sum f + g would also
be odd which would violate our assumption as well as the definition of an even integer.

c. Proof method: Proof by contradiction.


√ √
Assumption: ab = c and a > c and b > c where a,b,c are positive real numbers.

d. Proof Method: Direct Proof.


2
Claim: True, if x is a rational number then x 2+5 = z where z is a rational number.
Assumption: x is a rational number.
By applying the definition of rational number x = ab where a and b are integers in the lowest form and b 6= 0. Then
2
x2 = ab2 where x2 is also a rational number because a2 and b2 are positive integers and b2 6= 0. Again applying
the definition of rational numbers 5 is a rational number because it can be written in the form of 5 = 15 . Putting
2 2
everything together we get ab2 + bb2 ·5
·1 = f where f is also a rational number number. We can re-write the original
expression as f2 = z where z is a rational number.

e. Proof method: Proof by contrapositive.


New Claim: For any real number x, if x2 is rational then x is rational or x3 is irrational.
Assumption x2 is rational.
Using the definition of rational numbers suppose x2 = a2 /b2 where a2 and b2 are positive integers and b2 6= 0.
Then by taking the square root of both sides we get x = a/b where a and b are integers and b2 6= 0. The first

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.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy