Health & Science

A 55-Year-Old Math Problem Was Solved—This Time by Humans

· GlobeWire Daily Editorial Desk · Source: www.wired.com

2 min read

A 55-Year-Old Math Problem Was Solved—This Time by Humans
WIRED · resized and padded · Photo source

A mathematical conjecture posed in 1971 by the late mathematician Ronald Graham has officially been resolved through a series of four papers, culminating in a February 2026 proof. The problem, which some researchers suggest may have been inspired by Graham’s interest in juggling, deals with rearranging sets of integers in clock arithmetic such that all partial sums remain distinct.

Understanding the Mathematical Puzzle

  • The Core Question: If you take a set of nonzero numbers in a finite clock arithmetic system (repeating after a prime number \(p\)), can you always rearrange them so that every cumulative partial sum is unique?
  • Clock Arithmetic Context: In this setting, numbers wrap around a fixed limit \(p\), making multiples of \(p\) equivalent to zero.
  • The Juggling Analogy: Researchers note parallels to juggling patterns, where each ball stays in the air for a different duration, requiring an order that prevents two balls from landing simultaneously.

Collaborative Breakthrough Across Four Papers

For decades, Graham’s conjecture remained unproven. Recently, several mathematicians approached different aspects of the problem:

  • Large and Medium Sets: Alp Müyesser, Alexey Pokrovskiy, Noah Kravitz, Benjamin Bedert, and colleagues tackled scenarios involving larger subsets through probabilistic methods and strategic adjustments to eliminate zero-sum sequences.
  • Small Sets: Kravitz and Bedert independently addressed instances where the number set is very small compared to \(p\), posting their findings in September 2024.
  • The Final Resolution: In February 2026, Lisa Sauermann (University of Bonn) and Huy Tuan Pham (University of Chicago) posted a 27-page proof covering the remaining cases using Fourier analysis and an anti-concentration technique to bound the probability of undesirable zero-sum overlaps.

Practical Implications and Verification

The collective findings confirm that valid structural arrangements are always achievable under these mathematical constraints for sufficiently large \(p\). However, researchers note that the proof assumes \(p\) is exceptionally large (such as \(10^{100}\)), meaning the findings do not practically apply to choreographing physical juggling routines.

Readers interested in verifying or exploring the original research can review the published preprints and subsequent articles detailed in mathematics archives and academic publications such as Quanta Magazine.

Share this article

About the author

GlobeWire Daily Editorial Desk

More to read