Mathematicians Solve Ronald Graham's 1971 Problem on Distinct Partial Sums
A long-standing combinatorics question posed by mathematician Ronald Graham in 1971 has been proven, according to Quanta Magazine. The problem asked whether any set of distinct nonzero integers can always be ordered so that every running total—the sum of the first two numbers, first three, and so on—is unique, including in finite, clock-like number systems where values repeat. Researchers have now shown this ordering is always possible, resolving a case that had remained open for over five decades.
GoKawiil's interpretation of the reporting above, not reported fact.
The result closes a gap in a problem that connects abstract number theory to tangible patterns, such as the juggling-inspired framing Graham himself used, where each 'ball' corresponds to a number and collisions represent repeated sums. Quanta's coverage suggests the proof may offer new techniques for handling similar ordering and sum-distinctness problems in modular or cyclic systems, which could have broader implications in combinatorics research.
- Ronald Graham posed the open question about distinct partial sums in 1971.
- The unresolved case involved numbers in finite, modular (clock-like) systems.
- Mathematicians have now proven an ordering always exists, per Quanta Magazine.
Source: wired.com — Shalma Wegsman, 2026-11-08
Published there as: “A 55-Year-Old Math Problem Was Solved—This Time by Humans”
Read the original report → The summary and analysis above are GoKawiil's own, written from reporting by the source above. Facts and quotes belong to the original publisher.