Math 2534 Solution Homework 9 Problem 1: Use elements to prove the following theorems: Theorem 1: If A B, then A C B C for all sets A, B, C . Proof: x, x A C x A x C By definition of Difference x B x C since A B x ( B C) By definition of Difference AC B C Theorem 2: P( A) P( B) P( A B) for all sets A and B Proof: x, x P( A) P( B) x P( A) x P( B) by definition of union x A x B by definition of power set x ( A B) by definition of union x P( A B) by definition of Power set P( A) P( B) P( A B) Problem 2: Use Algebra of sets to prove the following theorems given the sets A and B. Theorem 4: The symmetric difference A B ( A B) ( A B) may also be expressed as A B ( A B) ( B A) . (Hint: Prove that ( A B) ( A B) ( A B) ( B A) ) Proof: ( A B) ( A B) given ( A B) ( A B) C By definition of Difference ( A B) ( A B ) C C DeMorgan's Law [( A B) A ] [( A B ) B ] C C By Distribution Law [( A A ) ( B A )] [( A B ) ( B B )] C C C [ ( B AC )] [( A B C ) ] C By Distribution Law By Complement Law ( B AC ) ( A B C ) By Identity Law ( B A) ( A B) By definition of Difference ( A B) ( B A) ( A B) ( A B) ( A B ) ( B A) By Commutative Law Problem 3: Prove using set Algebra prove the following theorems given sets A and B. Theorem: [( AC BC ) A]C A Pr oof [( AC BC ) A]C Given [( AC BC ) AC ]C Equivalent form of Difference [ AC ]C By Absorption A Double Complement Problem 4: Using the formula n(ABC) = n(A) + n(B) + n(C) - n(AB) - n(AC) n(BC) + n(ABC) solve the following. Five hundred V.T students were surveyed to find out how many made use of the Emporium. In particular tutoring, study areas and computers. Two hundred and eighty five use the tutoring, one hundred and ninety five use the study areas, one hundred and fifteen use the computers, forty five use both tutoring and computers, seventy use tutoring and study areas, fifty use the study areas and computers and fifty used none of these. a) How many used all three? b) How many used study areas only ? c) How many used computers only? . Answers: a) 15 students b) 90 students c) 40 students Problem 5: Given the Boolean Algebra B with operations and where h is the identity for and k is the identity for , prove the following theorem by supplying the justification for each step. Theorem: For all elements a, b in B, (a b) a = a Proof: (a b) a = (a a) (b a) = a (b a) = a (a b) = Given distribution Idempotent commutative (a k) (a b) = Identity k for a ( k b) = distribution ak = Dominance Law a Identity for
© Copyright 2026 Paperzz