Discrete Mathematics with Applications 4th Edition

Published by Cengage Learning
ISBN 10: 0-49539-132-8
ISBN 13: 978-0-49539-132-6

Chapter 11 - Analysis of Algorithm Efficiency - Exercise Set 11.4 - Page 763: 18

Answer

The number of binary digits needed to represent 148206 = $\lfloor log_2(148206) \rfloor$ +1 = 18

Work Step by Step

The number of binary digits needed to represent $n$ is $\lfloor log_2(n) \rfloor +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.