Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
18 views

Assignment 2 - 2019

This document covers topics in sets and methods of proof for mathematics for computer science. It includes exercises on set operations, equivalence relations, different proof techniques like direct proof, proof by contradiction, proof by contrapositive, and proof by cases. It also covers proofs using principles of mathematical induction and properties of rational and irrational numbers. Students are asked to solve problems applying these set and proof concepts and techniques.

Uploaded by

Sivalingam Sivacumaran
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

Assignment 2 - 2019

This document covers topics in sets and methods of proof for mathematics for computer science. It includes exercises on set operations, equivalence relations, different proof techniques like direct proof, proof by contradiction, proof by contrapositive, and proof by cases. It also covers proofs using principles of mathematical induction and properties of rational and irrational numbers. Students are asked to solve problems applying these set and proof concepts and techniques.

Uploaded by

Sivalingam Sivacumaran
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

BSCS 11014 – Mathematics for Computer Science I

Assignment 2

Topics covered: Sets and Methods of proof

1. (a) Let the universal set 𝑈 = {1, 2, 3, ⋯ ,10}, 𝐴 = {1, 4, 7, 10}, 𝐵 = {1, 2, 3, 4, 5} and
𝐶 = {2, 4, 6, 8}.
List elements of each of the following sets:

(i) 𝐴∪𝐵 (ii) 𝐵∩𝐶 (iii) 𝐴 − 𝐵 (iv) 𝐵−𝐴


(v) 𝐴 ∩ (𝐵 ∪ 𝐶) ̅
(vi) 𝐵 ∩ (𝐶 − 𝐴) (vii) (𝐴 ∩ 𝐵) − 𝐶
(ix) ̅̅̅̅̅̅̅
𝐴∩𝐵∪𝐶 (x) (𝐴 ∪ 𝐵) − (𝐶 − 𝐵).

(b) Let 𝐴, 𝐵 and 𝐶 be sets. Show that

(i) 𝐴 − 𝐵 = 𝐴 ∩ 𝐵̅ (ii) (𝐴 − 𝐵) − 𝐶 ⊆ 𝐴 − 𝐶
(iii) (𝐴 − 𝐶) ∩ (𝐶 − 𝐵) = ∅ (iv) (𝐵 − 𝐴) ∪ (𝐶 − 𝐴) = (𝐵 ∪ 𝐶) − 𝐴
(v) (𝐴 ∩ 𝐵) ∪ (𝐴 ∩ 𝐵̅) = 𝐴 (vi) (𝐴 − 𝐵) − 𝐶 = (𝐴 − 𝐶) − (𝐵 − 𝐶)

(c) Let 𝐴 and 𝐵 be subset of a universal set 𝑈. Show that 𝐴 ⊆ 𝐵 if and only if 𝐵̅ ⊆ 𝐴̅.

(d) The symmetric difference of two sets 𝐴 and 𝐵, is denoted by 𝐴 + 𝐵, and defined by

𝐴 + 𝐵 = (𝐴 − 𝐵) ∪ (𝐵 − 𝐴).

By using the algebra of sets, show that


(i) 𝐴 + 𝐵 = (𝐴 ∪ 𝐵) ∩ (𝐴̅ ∪ 𝐵̅),
(ii) 𝐴 + 𝐴 = ∅, 𝐴 + 𝐴̅ = 𝑈, 𝐴 + ∅ = 𝐴 and 𝐴 + 𝑈 = 𝐴̅,
(iii) 𝐴 + 𝐵 + 𝐵 + 𝐴,
(iv) 𝐴 ∩ (𝐵 + 𝐶) = (𝐴 ∩ 𝐵) + (𝐴 ∩ 𝐶),
(v) (𝐴 + 𝐵) + 𝐶 = 𝐴 + (𝐵 + 𝐶)
for subsets 𝐴, 𝐵 and 𝐶 of 𝑈.

2. (a) Determine whether each of the following relations are equivalence relation on the set
(1, 2, 3, 4, 5}. If the relation is an equivalence relation, list all the equivalence classes.

(i) {(1,1), (2,2), (3,3), (4,4), (5,5), (1,3), (3,1)}


(ii) {(1,1), (2,2), (3,3), (4,4), (5,5), (1,3), (3,1), 93,4), (4,3)}
(iii) {(1,1), (2,2), (3,3), (4,4)}
(iv) {(1,1), (2,2), (3,3), (4,4), (5,5), (1,5), (5,1), (3,5), (5,3), (1,3), (3,1)}
(v) {(𝑥, 𝑦)|1 ≤ 𝑥 ≤ 5, 1 ≤ 𝑦 ≤ 5}
(vi) {(𝑥, 𝑦)|4 divides 𝑥 − 𝑦}
(vii) {(𝑥, 𝑦)|3 divides 𝑥 + 𝑦}
(viii) {(𝑥, 𝑦)|𝑥 divides 2 − 𝑦}

(b) (i) The relation 𝑅 is defined on the set of natural numbers ℕ by 𝑎𝑅𝑏 if 𝑎 + 𝑏 is an
even integer. Show that 𝑅 is an equivalence relation. Find the equivalence class of
2.

Page 1 of 2
(ii) Show that the relation 𝑅 = {(𝑎, 𝑏)|𝑎𝑏 > 0} defined on the set of non zero real
numbers (i.e., on ℝ − {0}) is an equivalence relation. Find the equivalence class of
2.

(iii) A relation 𝑅 is defined on the set 𝑉 of all points 𝑃(𝑥, 𝑦) in the 𝑥𝑦-plane by

(𝑥, 𝑦)𝑅(𝑧, 𝑡) if and only if 𝑥 2 + 𝑦 2 = 𝑧 2 + 𝑡 2 .


Show that 𝑅 is an equivalence relation on 𝑉 and find the equivalence class
determined by the point 𝐴(3,4). Geometrically interpret the equivalence class
of the point 𝐴(3,4).

3. (a) Prove that the square of an even integer is an even integer using
(i) a direct proof
(ii) a proof by contradiction
(iii) a proof by contrapositive

(b) Prove that if 𝑛 is an integer and 𝑛3 + 5 is odd, then 𝑛 is even using


(i) a proof by contradiction
(ii) a proof by contrapositive

(c) Prove that if 𝑛 is an integer and 3𝑛 + 2 is even, then 𝑛 is even using


(i) a proof by contradiction
(ii) a proof by contrapositive

(d) Using the method of proof by cases, prove that if 𝑥and 𝑦 are real numbers, then
max(𝑥, 𝑦) + min(𝑥, 𝑦) = 𝑥 + 𝑦.

4. (a) Using a suitable method of proof, prove each of the following if and only if statements
about integers.

(i) 𝑥 is even if and only if 𝑥 2 is even.


(ii) 𝑥𝑦 is odd if and only if x is odd and 𝑦 is odd.
(iii) 𝑥 is odd if and only if 𝑥 2 + 6𝑥 + 9 is even.
(iv) 𝑛 is even if and only if 7𝑛 + 4 is even.

(b) Use Principle of Mathematical Induction to prove the following statements.

(i) 7𝑛 − 1 is divisible by 6, for 𝑛 ∈ ℕ.


(ii) 6 ∙ 7𝑛 − 2 ∙ 3𝑛 is divisible by 4, for 𝑛 ∈ ℕ.
(iii) 3𝑛 + 7𝑛 − 2 is divisible by 8, for 𝑛 ∈ ℕ.

(c) (i) Prove or disprove that the product of two irrational numbers is irrational.
(ii) Prove or disprove that the product of a non zero rational number and an irrational
number is irrational.

Submit on or before 12th April 2019.

Page 2 of 2

You might also like