Six tiles, one proof
A pair can add up perfectly and still spoil the puzzle. Can your group convince another table that its solution is the only one?
1. Make the first move
Write each number on a scrap of paper or cross numbers off as you go. Use every tile once to make the three targets. Two players can take turns explaining one move each.
Tiles 1 2 3 5 7 8
Targets 9 7 10
Find two candidate pairs for 9. Which choice leaves a valid pair for 7? Write one sentence explaining why the other first move fails.
2. Trade proofs
Tiles 1 3 4 6 7 10
Targets 10 8 13
A player starts with 3 + 7. Can you disprove that move without trying every pairing? Exchange explanations and look for the step that rules it out.
3. Count every possible finish
Ignore the targets and count how many ways six distinct tiles can be split into three unordered pairs. Explain why choosing which pair to write down first should never change the count.
Facilitator answer key
First board. A 9 must be 1 + 8 or 2 + 7. Taking 2 and 7 leaves 1, 3, 5 and 8, with no pair totaling 7. Taking 1 and 8 leaves 2 + 5 for 7 and 3 + 7 for 10. There is only one complete solution.
Second board. A 10 must be 3 + 7 or 4 + 6. Taking 3 and 7 leaves 1, 4, 6 and 10, with no pair totaling 8. Taking 4 and 6 allows 1 + 7 for 8 and 3 + 10 for 13.
Counting challenge. Pick the smallest tile. It has five possible partners. The smallest remaining tile has three partners and the last pair is forced. This gives 5 × 3 × 1 = 15. The smallest-tile rule counts each matching exactly once.
Try a fresh board together
Everyone sees the same six tiles on the same UTC date. Play in a browser with no account, then ask another group to explain a tempting wrong first move.