# The total number of divisors of those integers with the most divisors

I'm interested in summing $\tau(m)$, the number of positive divisors of $m$, not over all integers in an interval but rather over only the integers with the most divisors. More specifically:

Given a large positive integer $x$, let $n_1, n_2, \dots, n_x$ be the integers $1, 2, \dots, x$, arranged so that $\tau(n_1) \ge \tau(n_2) \ge \cdots \ge \tau(n_x)$. I'm interested in the behavior of the function $$f(x,y) = \sum_{j=1}^y \tau(n_j).$$ For example, when $y=1$ then $f(x,1)$ is just the maximal order of the divisor function $\tau$; when $y=x$ we have $f(x,x) \sim x\log x$ by Dirichlet. I believe that we have $f(x,y) \sim x\log x$ even when $y$ is as small as $x/(\log x)^\beta$ for $\beta<\log4-1$.

I'm most interested in getting values of $f(x,y)$ that look like $x/(\log x)^\delta$. For example, I believe we can show (using the Selberg–Sathe formula) that $$f\big(x, x{(\log x)^{\alpha(1-\log\alpha)-1}} \big) \sim x{(\log x)^{\alpha(1-\log\alpha)-1+\alpha\log 2+o(1)}}$$ for $\alpha\ge 2$.

Soundararajan mentions a similar result in his paper Omega results for the divisor and circle problems, but for $\sum \tau(n_j) n_j^{-3/4}$ rather than $\sum \tau(n_j)$.

Has the behavior of $f(x,y)$ already been worked out in the literature? I would very much like to cite existing results, assuming they exist, rather than prove this from scratch.

• If you look at highly composite numbers, you quickly conjecture that f(x,x^alpha) is about f(x,x)/2 for alpha a slowly increasing function of x, which starts at alpha=1/2 for small x and grows quite slowly. I suspect alpha does not reach 3/4 until x is over a trillion. Gerhard "Is Looking At The Outliers" Paseman, 2018.04.28. – Gerhard Paseman Apr 29 '18 at 6:55
• I think you want the dissertation of Guy Robin. I don't have it. Compare list by his adviser Nicolas math.univ-lyon1.fr/~nicolas/publications.html – Will Jagy Apr 30 '18 at 1:48