We have maxx fMult (x) maxx g(x) \leq < 1 + 2 \cdot 10−7 .
Statement
We have maxx fMult (x) maxx g(x) \leq < 1 + 2 \cdot 10−7 . minx fMult (x) minx g(x) We conjecture that max x fMult (x) minx fMult (x) > 1; an inequality of this type can be proved when studying divisors of smooth numbers in sufficiently short dyadic intervals. Let M (n) = |{x \in [n] : x = x1 x2 with xi \leq n}|. The quantity M (n) is exactly the number of distinct entries in the n \times n multipli- cation table. It also arises naturally in the study of divisors of a random integer: M (n) is roughly the number of integers in [n2 ] with a divisor in [n/2, n]. Let (1 + log log 2) \delta =1− \approx .0860713 log 2 be the Erdős–Tenenbaum–Ford constant. Work of Erdős [1] proves that n2 (log n)−\delta+o(1) ≪ M (n) ≪ n2 (log n)−\delta+o(1) . This was sharpened, up to multiplicative constants, in celebrated work of Ford [5], who proved that n2 (log n)−\delta (log log n)−3/2 ≪ M (n) ≪ n2 (log n)−\delta (log log n)−3/2 . Our main theorem is the following. Theorem 1 (Green-S. ‘25+). Let X x+z g(x) = (log 2)x+z (1 − e−2 ). z\inZ
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.