Discrete Mathematics and Its Applications, Seventh Edition

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

Chapter 8 - Section 8.1 - Applications of Recurrence Relations - Exercises - Page 511: 25

Answer

$64$

Work Step by Step

In the previous answer(Q -24), we found that $T_n = 2^{n-1}$ where $T_n$ is the number of bit strings of length n with an even number of 0s. So, number of bit strings of length 7 with an even number of 0s = $2^{7-1} = 2^6 = 64$. Thus, there are 64 bit-strings of length 7 with an even number of 0s
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.