Wiki
Wiki

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

Updated


Claim. When Xn={0}X_n=\{0\} for every n∈An\in A, the set BB of Problem 486 has a logarithmic density, for every A⊆NA\subseteq\mathbb N. In this case BB is the set of integers that are not proper multiples of a member of AA. Theorem 1(a) of H. Davenport and P. Erdős, On sequences of positive integers, Acta Arith. 2 (1936), 147–151 (card), proves that the set of all multiples of a sequence a1,a2,…a_1,a_2,\ldots has logarithmic density A\mathcal A, the limit of the inclusion-exclusion densities of the multiples of its first mm terms; the proof writes the Dirichlet series of the set's indicator as ζ(s)\zeta(s) times a series whose finite approximants are monotone in ss and applies a Tauberian theorem of Hardy and Littlewood. The set of all multiples of AA differs from the set of proper multiples by the members of AA divisible by no smaller member, a primitive set, and by Behrend's theorem the reciprocal sum of a primitive set up to xx is O(log⁡x/log⁡log⁡x)O(\log x/\sqrt{\log\log x}), so that difference has logarithmic density zero (the bound is stated on the card of Erdős, Sárközy and Szemerédi's sharpening). Hence BB has logarithmic density 1−A1-\mathcal A. The same authors' second paper of the same title, J. Indian Math. Soc. (N.S.) 15 (1951), 19–24 (card), linked above, replaces the Tauberian argument by a direct elementary proof through the integers supported on the first kk primes.

Covers. Every instance in which every XnX_n is the zero class, for every choice of AA; for these the answer is yes. Not covered: any instance with a nonzero residue in some XnX_n, including the singleton case ∣Xn∣=1|X_n|=1 of Problem 25, which the site's remark says this problem generalizes, and the general case, for which Wang's 2026 manuscript on its own claim page claims a disproof. Besicovitch's examples, cited in the site's remark, show that natural density can fail even when Xn={0}X_n=\{0\} for all nn, which is why the problem asks for logarithmic density.

Depends on. No page of this wiki.

Acceptance. The refereed evidence is the 1936 journal publication in Acta Arithmetica, with the 1951 elementary proof in the Journal of the Indian Mathematical Society. The site labels the problem OPEN and its remark (page last edited 8 April 2026) credits both papers with the case Xn={0}X_n=\{0\}; a remark on an open problem is not an acceptance, so no reviewed evidence is listed. The records give the publication years and no finer dates, so the page carries the first day of 1936.