ABSTRACT
Preparation for Chapter 7
Prep Problem 7.1. Review binary (base 2) arithmetic. If you need a refresher, type “base 2” into https://wikipedia.org. Complete the missing entries in the following table: https://www.niso.org/standards/z39-96/ns/oasis-exchange/table">
Decimal fractional notation
Binary positional notation
https://www.w3.org/1998/Math/MathML"> − 2 1 2 https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781482243048/27066273-287e-4f87-9432-f815edbc9855/content/eq466.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/>
−10.1
23
10101
https://www.w3.org/1998/Math/MathML"> 1 4 https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781482243048/27066273-287e-4f87-9432-f815edbc9855/content/eq467.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/>
https://www.w3.org/1998/Math/MathML"> 5 8 https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781482243048/27066273-287e-4f87-9432-f815edbc9855/content/eq468.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/>
.01101
https://www.w3.org/1998/Math/MathML"> − 12 9 16 https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781482243048/27066273-287e-4f87-9432-f815edbc9855/content/eq469.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/>
−11.10101
(In truth, you will not need to deal with binary fractions in this chapter, but they appear frequently in combinatorial game theory. See, for example, Problem 10 of Chapter 5 on page 134.)
To the instructor: green hackenbush from [BCG01, pp. 189–196] is completely solved, and the proofs are just hard enough to be a nice challenge for the solid undergraduate student. You could cover the material immediately after Section 7.3.
The real excitement is playing the game.
Donald Trump