Read: Sections 1.3–1.5, rest of 2.1, and start of 2.2 (from our book). At the end of Section 2.1, you don’t need to worry about minimal generating sets right now.
Problems to Try: 2.8, 2.13, 2.20, 2.21 (from our book). Write down your ideas/solutions, and we’ll discuss them in class.
- On 2.8 just describe your algorithm; you do not need to determine the max number of spins to unscramble a board.
- Important note: typically we won’t be doing every problem and theorem from our book. However, when doing a given problem, you are allowed to utilize the results of all previous problems and theorems, even if we didn’t prove them (like 2.6 and 2.7).