You have n cubical building blocks. You try to arrange them into the largest possible solid cube, but you find that don’t have quite enough blocks: One side of the large cube has exactly one row too few.
Prove that n is divisible by 6.
Let x be the number of blocks in a full row. Then
n = x3 – x
= x(x + 1)(x – 1).
These factors are three consecutive integers, which means that at least one of them is even and one is divisible by 3.
Since its factors include numbers that are divisible by both 2 and 3, n is divisible by 6.
May 20, 2013 | Puzzles
Futility Closet is a collection of entertaining curiosities in history, literature, language, art, philosophy, and mathematics, designed to help you waste time as enjoyably as possible.
You can read Futility Closet on the web, subscribe by RSS, or sign up to receive a free daily email -- see "Subscribe by Email" in the sidebar.
The site is growing, so we've set up a separate blog on which readers can join in a discussion of future endeavors. Click the "Blog" link at left.