Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Problem 433

../

claims/: The 1 claim page of Problem 433, one per claimant's result; the problem's standing derives from them.


Statement. If A⊂NA\subset \mathbb{N} is a finite set then let G(A)G(A) denote the greatest integer which is not expressible as a finite sum of elements from AA (with repetitions allowed). Let

g(k,n)=max⁡G(A)g(k,n)=\max G(A)

where the maximum is taken over all A⊆{1,…,n}A\subseteq \{1,\ldots,n\} of size $\lvert A\rvert=k$ which has no common divisor. Is it true that

g(k,n)∼n2k−1?g(k,n)\sim \frac{n^2}{k-1}?

Formulation. The statement names no regime for the asymptotic, and the question depends on one. The site's commentary reads it, as Erdős and Graham presumably meant it, with kk fixed and n→∞n\to\infty, and the standing on this page concerns that reading. Dixmier's two-sided bounds, on the claim page, give the asymptotic for fixed kk and uniformly whenever k=o(n)k=o(n), but the asymptotic fails when kk is comparable to nn: for k=n−1k=n-1 every set of that size contains 11 or is {2,…,n}\{2,\ldots,n\}, so g(n−1,n)=1g(n-1,n)=1, while n2/(n−2)∼nn^2/(n-2)\sim n; more generally, when k/n→αk/n\to\alpha with 1/α1/\alpha not an integer, Dixmier's upper bound is (⌈1/α⌉−1+o(1)) n(\lceil1/\alpha\rceil-1+o(1))\,n, which is below n/αn/\alpha.

Status. PROVED (LEAN): the site's label; its commentary credits Dixmier with the proof. The frontmatter standing is derived from the accepted claim page Dixmier's bounds, accepted on the site's credit and the refereed publication; the Lean part of the label refers to a forum-posted formalization of Dixmier's theorems, recorded on that page, which this corpus has not built or audited.

Source. erdosproblems.com/433, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #433, https://www.erdosproblems.com/433.

References.

  • [Di90] Dixmier, Jacques, Proof of a conjecture by Erdős and Graham concerning the problem of Frobenius. J. Number Theory (1990), 198-209.
  • [ErGr72] Erdős, P. and Graham, R. L., On a linear diophantine problem of Frobenius. Acta Arith. (1972), 399-408.

Formalization. Statement in formal-conjectures. The forum-posted Lean proof of Dixmier's theorems is recorded on the claim page.

Progress

Not yet compiled.

Known Results

Not yet compiled.

Linked library material

These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.