Question 1. Let A and B be sets. (a) Prove that P(A) nP(B) = P(ANB). (b) Prove that P(A) UP(B) ≤ P(AUB). (c) Give an example of sets A, B such that P(A) UP(B) ‡ P(AUB). Question 2. Suppose that A, B and C are sets which satisfy both of the following conditions: (a) AUC BUC; (b) AnCBN C. Prove that A = B. Question 3. Let = be the relation defined on wxw by (a, b) = (c, d) ad = cb. Determine whether or not = is an equivalence relation on wxw. (Of course, it is not enough merely to state that = is an equivalence relation or to state that = is not an equivalence relation. You must justify your answer!) Question 4. Let h: ww be the function defined recursively by h(0): = 1 h(n + 1) = 5h(n) + 7n. Prove by induction that for all new, h(n) = 5n+7n 2
Question 1. Let A and B be sets. (a) Prove that P(A) nP(B) = P(ANB). (b) Prove that P(A) UP(B) ≤ P(AUB). (c) Give an example of sets A, B such that P(A) UP(B) ‡ P(AUB). Question 2. Suppose that A, B and C are sets which satisfy both of the following conditions: (a) AUC BUC; (b) AnCBN C. Prove that A = B. Question 3. Let = be the relation defined on wxw by (a, b) = (c, d) ad = cb. Determine whether or not = is an equivalence relation on wxw. (Of course, it is not enough merely to state that = is an equivalence relation or to state that = is not an equivalence relation. You must justify your answer!) Question 4. Let h: ww be the function defined recursively by h(0): = 1 h(n + 1) = 5h(n) + 7n. Prove by induction that for all new, h(n) = 5n+7n 2
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
This is Set Theory
Transcribed Image Text:Question 1. Let A and B be sets.
(a) Prove that P(A) nP(B) = P(ANB).
(b) Prove that P(A) UP(B) ≤ P(AUB).
(c) Give an example of sets A, B such that P(A) UP(B) ‡ P(AUB).
Question 2. Suppose that A, B and C are sets which satisfy both of the following
conditions:
(a) AUC
BUC;
(b) AnCBN C.
Prove that A = B.
Question 3. Let = be the relation defined on wxw by
(a, b) = (c, d)
ad = cb.
Determine whether or not = is an equivalence relation on wxw.
(Of course, it is not enough merely to state that = is an equivalence relation or to
state that = is not an equivalence relation. You must justify your answer!)
Question 4. Let h: ww be the function defined recursively by
h(0):
=
1
h(n + 1) = 5h(n) + 7n.
Prove by induction that for all new,
h(n) =
5n+7n
2
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 3 images
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
