Cubes a diagonal piercesEdges up to 8
A rod is pushed corner to corner through a block of unit cubes. Count the ones it passes through, and show why a + b + c is too many.
Push a straight rod from one corner of a box of unit cubes to the opposite corner. It clips some cubes and misses others — and counting them one by one is hopeless for a big box, so the trick is to count the walls it crosses instead.

The answer key prints on a separate page.
The rod enters a new little cube every time it crosses an inside wall, so a first guess is just how many walls there are: a + b + c. But that over-counts, because sometimes the rod crosses two walls at the very same point — it slips through the shared edge of two cubes and only enters ONE new cube, not two. How often that happens for each pair of directions is exactly the greatest common divisor of those two edge lengths, so the three pairwise GCDs come off the total.
Take one off too many, though: where all three walls meet at a single lattice point, the correction was applied twice, so the GCD of all three edges is added back. The whole count is a + b + c − gcd(a,b) − gcd(b,c) − gcd(c,a) + gcd(a,b,c) — inclusion and exclusion made physical, and a first glimpse of why the humble GCD is really about geometry.