How many ways can the eight vertices of a three-dimensional cube be colored red and blue such that no two points connected by an edge are both red? Rotations and reflections of a given coloring are considered distinct.
Problem 788
Official solution
Solution:
Answer:
We do casework on , the number of red vertices. Let the cube be called , with opposite faces and , such that is directly above .
- : There is one such coloring, which has only blue vertices.
- : There are ways to choose the red vertex, and all other vertices must be blue. There are colorings in this case.
- : Any pair not an edge works, so the answer is .
- : Each face and has at most two red spots. Assume WLOG has exactly two and has exactly one (multiply by at the end). There are two ways to pick those in (two opposite corners), and two ways after that to pick . Hence the grand total for this subcase is .
- : There are only two ways to do this.
Hence, the sum is .