The distribution of integers with a divisor in a given interval
Kevin Ford
Abstract
We determine the order of magnitude of H(x,y,z), the number of integers n x having a divisor in (y,z], for all x,y and z. We also study Hr(x,y,z), the number of integers n x having exactly r divisors in (y,z]. When r=1 we establish the order of magnitude of H1(x,y,z) for all x,y,z satisfying z x0.49. For every r 2, C>1 and ε>0, we determine the the order of magnitude of Hr(x,y,z) when y is large and y+y/( y) 4 -1 - ε z (yC,x1/2-ε). As a consequence of these bounds, we settle a 1960 conjecture of Erdos and several related conjectures. One key element of the proofs is a new result on the distribution of uniform order statistics.
Create a lesson
Related papers
An ergodic approach to equations of the form x+y=α(n)
Vitaly Bergelson, Hao Pan, Saúl Rodríguez Martín
Rogers--Ramanujan identities from the geometry of Xa=Yb
Yifeng Huang, Kenny Lau, Ken Ono
Computational results on sums of a prime with squares or cubes
Kenny Applegate, Kyle Pratt
Finding New Limit Points of Mahler Measure by Methods of Missing Data Restoration
Jean-Marc Sac-Épée, Souad El Otmani, Armand Maul et al.
Low moments of automorphic random multiplicative function sums
Sun-Kai Leung
A problem of Yang and Chen on weighted representation functions
Shuang-Shuang Li, Ya-Ting Xu, Xiao-Hui Yan