Wiki
Wiki

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

Updated


The claim. For every fixed r≥3r\ge3 and ε>0\varepsilon>0, fr(N)<N1/2+εf_r(N)<N^{1/2+\varepsilon} for all large NN, where fr(N)f_r(N) is the largest size of a subset of {1,…,N}\{1,\ldots,N\} with no rr elements of pairwise the same greatest common divisor, as in Problem 535. The result is H. L. Abbott and D. Hanson, An extremal problem in number theory, Bull. London Math. Soc. 2 (1970), no. 3, 324--326. The paper is not held, and no review of it was found, so the result is stated in the form Erdős's 1973 survey gives for it, Section 4, printed p. 123 of Erdős (1973): "I proved fr(x)<x3/4+εf_r(x)<x^{3/4+\varepsilon} (Erdős [1964a]). This was improved to x1/2+εx^{1/2+\varepsilon} by Abbott and Hanson [1970]." The page is named by the paper's issue, November 1970 according to its Crossref record, with the first day of the month standing in for the unknown day.

Covers. The upper exponent 1/21/2 only; the order of fr(N)f_r(N) is not determined.

Acceptance. Refereed: the journal publication. The site's commentary credits the result on a problem it labels OPEN, which is not acceptance.

Depends on. Nothing in this wiki: the result is the cited paper's, as the linked survey reports it.