Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Here is, in the paper's words (p. 315), "a set of positive integers with the least common multiple of each pair of terms not exceeding and being the largest". Theorem (pp. 315--316): "Let be a large real number. Then , where ."
The factor stands outside the square root. Remark (p. 316): the constant can be improved. Conjecture (p. 316): as .
Source. Li-Xia Dai and Yong-Gao Chen, Sequences with bounded l.c.m. of each pair of terms II, Acta Arith. 124 (2006), no. 4, 315--326, DOI 10.4064/aa124-4-2 (Crossref record read); the Theorem on printed pp. 315--316 = PDF pp. 1--2 of the publisher's 12-page file, read in the text layer and on the page images.
Read depth. Claims checked: the Theorem, the Remark and the Conjecture were read clause by clause on the page images of pp. 315--316. The proof (Sections 2--3, pp. 316--326) was not read beyond the statement of Lemma 1.
Proof pointer
Lemma 1 (p. 316) is Brun's pure sieve in the form of Halberstam--Richert, Lemma 2 the Rosser--Schoenfeld estimates for ; Section 3 applies them to the elements of outside Erdős's construction . Not read here.
Dependencies
Brun's pure sieve; Rosser--Schoenfeld 1962 (the paper's [8], [9]).
Bears on
- Problem 441: the quantitative form of the first answer, as the site quotes it, with the explicit constant and the lower bound .