Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 2 - Section 2.2 - Set Operations - Exercises - Page 137: 49

Answer

a) Here the sets are increasing. A bit string of length not exceeding 1 is also a bit string of length not exceeding 2, so Ai ~ Az. Similarly, Az ~ A3 ~ A4 ~ · · · ~ An. Therefore the union of the sets Ai, Az, ... , An is just An itself. b) Since Ai is a subset of all the Ai 's, the intersection is Ai , the set of all nonempty bit strings of length not exceeding 1, namely {O, 1}.

Work Step by Step

a) Here the sets are increasing. A bit string of length not exceeding 1 is also a bit string of length not exceeding 2, so Ai ~ Az. Similarly, Az ~ A3 ~ A4 ~ · · · ~ An. Therefore the union of the sets Ai, Az, ... , An is just An itself. b) Since Ai is a subset of all the Ai 's, the intersection is Ai , the set of all nonempty bit strings of length not exceeding 1, namely {O, 1}.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.