

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Assignment; Class: Discrete Structures; Subject: Computer Science; University: University of Illinois - Urbana-Champaign; Term: Spring 2007;
Typology: Assignments
1 / 3
This page cannot be seen from the preview
Don't miss anything!


a) Indirect Proof: n is odd if n^3 + 6 is odd (n is an integer). Proof: We prove that its contrapositive is true. Assume n is even. n can be expressed as 2k. Substitute it into n^3 + 6 , we get (2 )k 3 + 6 = 2(4 k^3 + 3). This indicates that n^3 + 6 is an even number. Therefore, its contrapositive is true. b) Proof by Contradiction: The product of an irrational number and a nonzero rational number is irrational. Before proving it by contradiction, here is the outline of a proof by contradiction: Original problem: we want to show that p q is true. We construct ( ¬( p → q ))→ F. Since the whole implication ( ¬( p → q)) → Fis true, ¬( p →q) must be false. Therefore, p q is true. ¬( p → q )⇔ p ∧ ¬q. In summary, what we need to do is first assume p ∧ ¬q , then derive some contradiction/fallacy from p ∧ ¬q. Proof: Assume the product of an irrational number and a nonzero rational number is rational ( p ∧ ¬q ). Denote the product by c d
, the irrational number k, and the nonzero rational number a b (a, b, c, and d are integers and b ≠ 0 ). We have c^ k a^ k cb d b ad
= ⋅ ⇒ =. Since a, b, c, and d are integers, cb and ad are integers too. Therefore, the irrational number k can be expressed as a fraction, which means it is a rational number. Apparently, this is a contradiction. ( ( p ∧ ¬q ) → F). Therefore, the original statement is true (p q is true).
c) Vacuous Proof: All positive real numbers x that satisfy x 2 + 7 x+ 12 < 0 are also solutions to the transcendental equation x + sin x= 0. Proof: The solution for x 2 + 7 x+ 12 < 0 is − 4 < x< − 3 , which is not positive. Therefore, it is vacuously true. d) Trivial Proof: If a > 0 and b ≤ − 2 , a 2 + ab + b^2 ≥ 0 Proof: 2 2 ( 1 ) 2 3 2 0 2 4
a + ab + b = a + b + b ≥ We see that it is always true for a b, ∈ R. Therefore, the statement is trivially true.
e) Proof by Cases: Prove that the square of an integer not divisible by 5 leaves a remainder of 1 or 4 when divided by 5. Proof: All integers not divisible by 5 can be expressed as 5k+1, 5k+2, 5k+3, or 5k+4. Case 1: (5 k + 1)^2 = 25 k 2 + 10 k + 1 = 5(5 k 2 + 2 )k + 1 Case 2: (5 k + 2)^2 = 25 k 2 + 20 k + 4 = 5(5 k 2 + 4 )k + 4 Case 3: (5 k + 3) 2 = 25 k 2 + 30 k + 9 = 5(5 k 2 + 6 k+ 1) + 4 Case 4: (5 k + 4)^2 = 25 k 2 + 40 k + 16 = 5(5 k 2 + 2 k+ 3) + 1 In all cases, the remainder is either 1 or 4.
x A B A B x A B x A B x A x B x A x B x A x
) ) (( ) ) distributive law ... absorption law
B x A x A x B x B x A x A
→ ∈ simplification
(part 2) A ⊆ ( A I B) U ( A IB) We need to show that x ∈ A → x ∈ ( A I B) U ( A IB) The set A can be split into two parts. One part is the intersection A I B(it might be empty), and the other part is A − B. A − Bis actually A I B. These two parts are nonoverlapping, and their union is A itself (using a Venn Diagram may help you understand it). Therefore, if x is an element of A, then it belongs to either A I Bor A I B.