Mathematics
Combinatorial Designs: Latin Squares and Steiner Systems
Quick fact
A Latin square of order n is an n×n grid filled with n symbols so that each symbol appears exactly once in each row and column. A Steiner triple system of order v exists if and only if v ≡ 1 or 3 (mod 6), a classic existence theorem in combinatorial design theory.
Why this is interesting
Imagine arranging a tournament where every team meets every other team exactly once, or scheduling a sudoku grid with no repeats—these puzzles hide a deep mathematical structure that helps design experiments and error-correcting codes. How can such simple rules lead to such powerful tools?