Chapter 16: Problem 1
In how many ways can we 5-color the vertices of a square that is free to move in (a) two dimensions? (b) three dimensions?
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 16: Problem 1
In how many ways can we 5-color the vertices of a square that is free to move in (a) two dimensions? (b) three dimensions?
All the tools & learning materials you need for study success - in one app.
Get started for free
a) In how many ways can we 5 -color the vertices of a regular hexagon that is free to move in two dimensions? b) Answer part (a) if the hexagon is free to move in three dimensions. c) Find two 5 -colorings that are equivalent for case (b) but distinct for case (a).
A baton is painted with three cylindrical bands of color (not necessarily distinct), with each band of the same length. a) How many distinct paintings can be made if there are three colors of paint available? How many for four colors? b) Answer part (a) for batons with four cylindrical bands. c) Answer part (a) for batons with \(n\) cylindrical bands. d) Answer parts (a) and (b) if adjacent cylindrical bands are to have different colors.
Find the elements in the groups \(U_{20}\) and \(U_{24}\)-the groups of units for the rings \(\left(\mathbf{Z}_{20},+, \cdot\right)\) and \(\left(\mathbf{Z}_{24},+, \cdot\right)\), respectively.
Let \(\omega\) be the complex number \((1 / \sqrt{2})(1+i)\). a) Show that \(\omega^{8}=1\) but \(\omega^{n} \neq 1\) for \(n \in \mathbf{Z}^{+}, 1 \leq n \leq 7 .\) b) Verify that \(\left\\{\omega^{n} \mid n \in \mathbf{Z}^{*}, 1 \leq n \leq 8\right\\}\) is an abelian group under multiplication.
If a regular pentagon is free to move in space and we can color its vertices with red, white, and blue paint, how many nonequivalent configurations have exactly three red vertices? How many have two red, one white, and two blue vertices?
What do you think about this solution?
We value your feedback to improve our textbook solutions.