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
AI contribution
Forbidden subset sums in a linear range: an inverse theorem and the Erdős-Graham irregularity problem
Matijasevick proves that the maximum size of a subset of the integers from 1 to the integer part of cn avoiding subset , divided by n, converges exactly when c is at least 1. For the limit superior is and the sequence has at least two limit points.
Sources
Publication history
Daily emails by default, only when there’s an update.