← All problems

Erdős–Nicolas–Sárközy conjecture on admissible subsets

For a finite set A⊆Z>0A\subseteq\mathbb{Z}_{>0}, call AA admissible if for all subsets B,C⊆AB,C\subseteq A, ∑b∈Bb=∑c∈Cc\sum_{b\in B}b=\sum_{c\in C}c implies ∣B∣=∣C∣|B|=|C|. Let a(N)a(N) be the number of nonempty admissible subsets of {1,…,N}\{1,\ldots,N\}. The Erdős–Nicolas–Sárközy conjecture asserts that log⁡a(N)≍N\log a(N)\asymp\sqrt{N} as N→∞N\to\infty; equivalently, there exist absolute constants c,C>0c,C>0 and an integer N0N_0 such that exp⁡(cN)≤a(N)≤exp⁡(CN)\exp(c\sqrt{N})\le a(N)\le\exp(C\sqrt{N}) for all N≥N0N\ge N_0.

References

Progress summary

Refreshed
Open · solution reported

An unrefereed October preprint claims to prove the conjecture’s predicted logarithmic growth law, but no independent assessment was found.

The Erdős–Nicolas–Sárközy conjecture predicts logarithmic growth for the number of admissible subsets. The problem has been open for roughly three decades.

October 2026 claimed proof

Guoqing Wang and Wenkai Yang claim that their preprint proves the conjectured logarithmic bounds, using a structural doubling argument for the upper bound. They also claim analogous results when admissible sets are counted by their maximum. The preprint is unrefereed, and no independent mathematical assessment was retrieved.

Current status (as of October 2026): A preprint claims the conjecture is solved, but the claim remains unverified; no independently assessed proof or contrary result was found.

Sources

Solutions 0

No solutions have been posted yet.