Each of the edges of a cube is labeled or . Two labelings are considered different even if one can be obtained from the other by a sequence of one or more rotations and/or reflections. For how many such labelings is the sum of the labels on the edges of each of the faces of the cube equal to ?
- A)
- B)
- C)
- D)
- E)
Answer
E
Key insight
Exactly six edges are 1s, and top and bottom use four, so exactly 2 upright edges are 1s. Opposite uprights give 12; neighboring uprights give 8.
Solution
- How many 1s? Each face adds to , and there are faces, so the face totals add to . Every edge lies on exactly faces, so each is counted twice in that . So there are exactly edges labeled .
- Split the edges. Stand the cube up. There are edges around the top square, around the bottom square, and upright edges joining them. The top face needs exactly two s, all on its own edges; the same for the bottom. That uses of the six s, so exactly of the upright edges are s.
- Name things. Number the upright edges going around. Each side face contains two neighboring upright edges, one top edge and one bottom edge. Call the side faces , , , by the uprights they contain.
Case A: the two upright 1s are opposite (uprights and , or and ). There are such choices.
- Take uprights and . Every side face contains exactly one of them. So each side face needs exactly one more : its top edge or its bottom edge, not both.
- The top face needs two s among its edges: ways. Each side face whose top edge is must then have its bottom edge be , so the bottom edges are fixed, and the bottom face also gets exactly two s. Everything works.
- Case A total: .
Case B: the two upright 1s are neighbors (like uprights and ). There are such choices.
- Face already has two s, so its top and bottom edges are .
- Face has no upright s, so its top and bottom edges must both be .
- The top face now has one (from face ) and needs one more, from the top edge of face or of face . Say it is face . Then face is full, so its bottom edge is . Face has top edge , so its bottom edge is . Check the bottom face: (from face ) (from face ) . It works. The other choice (face ) works the same way.
- So there are ways for each choice of uprights: .
Total. .
The answer is .
Why this works
First a counting fact for the whole cube (six s, because each edge sits on two faces), then a smart place to start (the four upright edges, which every side face uses). Once the uprights are chosen, every other edge is either forced or a simple two-way choice. Also note the sentence about rotations and reflections: it tells you not to divide by symmetries.
The trap
Dividing by the cube's symmetries. The problem says labelings that are rotations or reflections of each other still count as different.
Concise solution
How many ones? Each edge lies on exactly two faces, so adding the six face totals counts every edge twice: , so exactly edges are labeled .
Pivot on the vertical edges. The top and bottom faces each contain ones among their horizontal edges, accounting for ones, so exactly of the vertical edges are . Number the top corners in order; vertical edge hangs from corner , and side face contains , , top edge and bottom edge .
Case A: diagonal pair (; such pairs). Each side face has one vertical and needs exactly one of its : on all four sides. The top face needs two of the four 's equal to : ways. The 's are then forced and the bottom face automatically totals . Total .
Case B: adjacent pair (; such pairs). Face is full, so ; face has no vertical ones, so . Faces and each need exactly one of , while the top face needs one more from and the bottom one more from . Choosing forces , , ; the mirror choice also works. So completions, total .
Altogether .
The answer is .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.5)
- Introduction to Counting & Probability, Chapter 1: Counting Is Arithmetic
- Introduction to Geometry, Chapter 14: Three-Dimensional Geometry
- Introduction to Counting & Probability, Chapter 3: Correcting for Overcounting (§3.2, §3.4)
Techniques
Split into exhaustive cases and handle each · Use an invariant, parity, or coloring argument