Wiki
Wiki

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

Updated

Problem 886

../

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


Statement. Let ϵ>0\epsilon>0. Is it true that, for all large nn, the number of divisors of nn in (n1/2,n1/2+n1/2−ϵ)(n^{1/2},n^{1/2}+n^{1/2-\epsilon}) is Oϵ(1)O_\epsilon(1)?

Status. The site labels the problem OPEN. The answer is yes for every ϵ≥1/4\epsilon\ge1/4 by Erdős and Rosenfeld's bound; the range 0<ϵ<1/40<\epsilon<1/4 is open.

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

References.

  • [ErRo97] Erdős, Paul and Rosenfeld, Moshe, The factor-difference set of integers. Acta Arith. (1997), 353-359.

Formalization. Statement in formal-conjectures.

Current assessment

The site labels the problem OPEN (page last edited 1 February 2026). For every ϵ≥1/4\epsilon\ge1/4 the answer is yes: the window lies within n1/4n^{1/4} of n\sqrt n, where the bound of Erdős and Rosenfeld allows at most two divisors for every nn (claim page). For 0<ϵ<1/40<\epsilon<1/4 the problem is open. Their Proposition 4.2 gives infinitely many nn with four divisors within about 8n1/48n^{1/4} of n\sqrt n (the site prints 16n1/416n^{1/4}, the paper's bound on the factor differences), which settles no instance. Letendre's preprint (card), cited in the site's thread, gives O(1/(ϵ−1/4))O(1/(\epsilon-1/4)) divisors for every ϵ>1/4\epsilon>1/4 (its Proposition 1 at θ=1/2\theta=1/2). That range is already settled with a stronger bound, and the preprint is not refereed, so it has no claim page.

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.