The Zero-Sum Mystery: Why Two Piles Set the Toughest Benchmark
A 1992 conjecture asks how few zero-sum groups can hide in a sequence. A new proof shows two piles are the hardest arrangement to beat.
combinatorial mathematics
A 1992 conjecture asks how few zero-sum groups can hide in a sequence. A new proof shows two piles are the hardest arrangement to beat.