Discrete Mathematics and Its Applications, Seventh Edition

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

Chapter 6 - Section 6.6 - Generating Permutations and Combinations - Review Questions - Page 439: 1

Answer

2046 bit strings

Work Step by Step

Product rule states that if one event can occur in m ways and second event can occur in n ways then the two events can occur in sequence in m.n ways Sum rule states that if an event can occur in either m ways or in n ways (not overlapping), the number of ways the event can occur is m+n. We use the product rule to determine the number of bits strings with length n, and we use sum rule as there are $2^{n}$ bits of length n for each n from 1 to 10. So we get 2 + $2^{2}$ +...$2^{10}$ = 2046
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.