Discrete Mathematics and Its Applications, Seventh Edition

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

Chapter 1 - Section 1.8 - Proof Methods and Strategy - Exercises - Page 108: 26

Answer

U can never get 9 0's

Work Step by Step

let us consider that the circle contains 9 0's after iterating the procedure. We obtain 9 0's if all in the previous step were the same thus all bits were 0's or all bits were 1's. If the previous step contained all 0's, then we have the same the case as the current iteration step. Since initially the circle does not contain only zeros had to contain something else then only zeros at some point and thus there exist a point where the circle contained only 1's. A circle Contain only 1's if every pair of consecutive 9 digits is different, However, this is impossible because there were 5 1's and 4 0's thus 1's and 0's alternate, then we obtain that two 1's that will be next to each other (which would result in a one in next step). thus we obtained a contradiction and thus the assumption that the circle contains nine 0's after iterating the procedure is false. this then means that you can never get nine 0's.
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.