A speed-dating event design problem explores how to arrange rounds so every participant meets everyone exactly once without repeatedly hearing the same introductions. The solution involves combinatorial mathematics, specifically resolvable Steiner designs, which require divisibility constraints and can be elegantly constructed using finite field geometry when table size is a prime power.