A 55-Year-Old Math Problem Was Solved—This Time by Humans
In February 2026 Sauermann (University of Bonn) and Pham (University of Chicago) released the concluding paper that proves Graham’s conjecture for any prime modulus p. The conjecture asked whether any non‑zero set of integers modulo p can be reordered so that every cumulative sum is unique. The proof builds on a cascade of earlier results: Alp Müyesser (Oxford) and his advisor Alexey Pokrovskiy (UCL) showed that a random permutation, tweaked with a few reserved elements, works when the set is almost as large as p; Noah Kravitz and Benjamin Bedert (both Oxford) handled the opposite extreme where the set is tiny relative to p. By merging these probabilistic techniques, the collaborators produced a unified argument that covers all set sizes, finally confirming Graham’s intuition that flexibility persists even under the strict cyclic constraints.
The breakthrough illustrates a broader shift in combinatorial research toward cross‑disciplinary collaboration and heavy use of randomness to extract structure. Problems that once seemed purely deterministic—like constructing Latin squares or Sudoku grids—are now routinely attacked with probabilistic methods, echoing the “random‑then‑fix” strategy employed here. The involvement of mathematicians from distinct subfields (additive combinatorics, extremal graph theory) underscores a growing culture where young scholars pool diverse toolkits, often accelerated by preprint servers and informal networks rather than traditional hierarchical mentorship.
Beyond settling a historic question, the result may ripple into areas that rely on modular sequences with low collision risk, such as cryptographic hash designs, error‑correcting codes, and scheduling algorithms. However, the proof is largely non‑constructive; it guarantees existence without furnishing an efficient algorithm to produce the required ordering. Translating the existence proof into a practical, polynomial‑time construction will be the next technical hurdle. Watch for follow‑up work that extracts explicit algorithms, and for any emerging applications in computer science that leverage the newly confirmed combinatorial flexibility.
Key Takeaways
The Graham rearrangement conjecture is finally proved for every prime modulus, ending a five‑decade open problem.
The solution hinges on a hybrid “random‑then‑adjust” method that merges earlier large‑set and small‑set results.
Collaboration across disparate combinatorial specialties proved decisive, highlighting a new collaborative model among early‑career mathematicians.
Practical impact will depend on converting the existence proof into constructive algorithms for cryptography and scheduling.
About the Source
This analysis is based on reporting by Wired. Here is a short excerpt for context:
A group of young mathematicians found the solution to the long unanswered conjecture, first inspired by juggling, through randomness and friendship.Read the original at Wired
