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.1 - The Basics of Counting - Exercises - Page 396: 12

Answer

126

Work Step by Step

There are $2^n$ bit strings of length n [n choices each with two options] Thus the number of bit strings of length six or less, not counting the empty string = $2^1+2^2+2^3+2^4+2^5+2^6$ =$2+4+8+16+32+64$ =126 [The sum could also have been calculated by using Geometric Progression]
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.