Irregularity of forbidden subset sums in Erdős 361

Fix a positive real number c and a positive integer n. Among the integers from 1 to the integer part of cn, how large can a set be if no subset of distinct elements adds up to n? Erdős and Graham asked whether the maximum behaves irregularly as n grows.

Why it matters and what counts as progress

Why it matters: Avoiding one sum can depend on divisibility as well as the size of the available interval. The problem asks whether that dependence survives after dividing the maximum by n.

What counts as progress: Prove upper and lower bounds along sequences of n. Matching limits along different sequences can establish irregularity and help identify all possible limiting values.

How the problem developed

  1. 1987 · Special case [4]

    Noga Alon Determined an asymptotic for avoiding a subset sum twice the length of the interval.

  2. 12 Nov 2026 · Convergence classification [1][2]

    Mateo Matijasevick with GPT-5 and Claude Proved when the normalized maximum converges in the linear range.

AI contribution

Forbidden subset sums in a linear range: an inverse theorem and the Erdős-Graham irregularity problem

Mateo Matijasevick

Matijasevick proves that the maximum size of a subset of the integers from 1 to the integer part of cn avoiding subset ∑n\sum n, divided by n, converges exactly when c is at least 1. For 0<c<10 < c < 1 the limit superior is c/2c/2 and the sequence has at least two limit points.

AI involvementAI-centered
ImportanceNotable
Technical verificationFormal (Lean 4)
Human understandingFew
Paper date:

Sources

  1. Forbidden subset sums in a linear range: an inverse theorem and the Erdős-Graham irregularity problem
  2. Formal proof and verification scope
  3. Erdős Problems, Problem 361
  4. Noga Alon, Subset Sums
Publication history