← All problems

Erdős Problem #330 — Essential elements in positive-density minimal bases

46 years old · traced to

A question of Erdös and Nathanson is the following. Suppose a1<a2<…a_1 < a_2 < \ldots is a minimal basis which has positive density. Can it happen that for any aka_k, the (upper) density of the integers which cannot be represented without using aka_k is positive?

References

Erdős, P. and Graham, R., Old and new problems and results in combinatorial number theory. Monographies de L'Enseignement Mathématique 28 (1980).

Source: Erdős, P. and Graham, R., Old and new problems and results in combinatorial number theory. Monographies de L'Enseignement Mathématique 28 (1980).

Progress summary

Refreshed
Open · progress reported

A construction has been claimed, but no independently verified proof is available, so the question remains open.

The problem asks whether a minimal additive basis AA of positive density can be so sensitive that deleting any n∈An \in A leaves a positive-density set of integers unrepresentable. It was posed by Erdős and Nathanson; the intended density convention for AA may have been positive upper density.

Known results

  • Nathanson (1987) records earlier minimal-basis work by Stöhr, Härtter, and Nathanson, while identifying the positive-density strengthening as open.
Sources

Solutions 0

No solutions have been posted yet.