no. 2
Sur les entiers inférieurs à x ayant plus de log(x) diviseurs
Journal de Théorie des Nombres de Bordeaux, Tome 6 (1994) no. 2, pp. 327-357.

Let τ ( n ) be the number of divisors of n ; let us define

S λ ( x ) = Card n ≤ x ; τ ( n ) ≥ ( log x ) λ log 2 if λ ≥ 1 Card n ≤ x ; τ ( n ) < ( log x ) λ log 2 if λ < 1
It has been shown that, if we set
f ( λ , x ) = x ( log x ) λ log λ - λ + 1 log log x
the quotient S λ ( x ) / f ( λ , x ) is bounded for λ fixed. The aim of this paper is to give an explicit value for the inferior and superior limits of this quotient when λ ≥ 2 . For instance, when λ = 1 / log 2 , we prove
lim inf S λ ( x ) f ( λ , x ) = 0 . 938278681143 ⋯
and
lim inf S λ ( x ) f ( λ , x ) = 1 . 148126773469 ⋯ 

@article{JTNB_1994__6_2_327_0,
     author = {Del\'eglise, Marc and Nicolas, Jean-Louis},
     title = {Sur les entiers inf\'erieurs \`a $x$ ayant plus de $\log (x)$ diviseurs},
     journal = {Journal de Th\'eorie des Nombres de Bordeaux},
     pages = {327--357},
     publisher = {Universit\'e Bordeaux I},
     volume = {6},
     number = {2},
     year = {1994},
     zbl = {0839.11041},
     mrnumber = {1360649},
     language = {fr},
     url = {http://www.numdam.org/item/JTNB_1994__6_2_327_0/}
}
TY  - JOUR
AU  - Deléglise, Marc
AU  - Nicolas, Jean-Louis
TI  - Sur les entiers inférieurs à $x$ ayant plus de $\log (x)$ diviseurs
JO  - Journal de Théorie des Nombres de Bordeaux
PY  - 1994
DA  - 1994///
SP  - 327
EP  - 357
VL  - 6
IS  - 2
PB  - Université Bordeaux I
UR  - http://www.numdam.org/item/JTNB_1994__6_2_327_0/
UR  - https://zbmath.org/?q=an%3A0839.11041
UR  - https://www.ams.org/mathscinet-getitem?mr=1360649
LA  - fr
ID  - JTNB_1994__6_2_327_0
ER  - 
Deléglise, Marc; Nicolas, Jean-Louis. Sur les entiers inférieurs à $x$ ayant plus de $\log (x)$ diviseurs. Journal de Théorie des Nombres de Bordeaux, Tome 6 (1994) no. 2, pp. 327-357. http://www.numdam.org/item/JTNB_1994__6_2_327_0/

[1] M. Balazard, J.-L. Nicolas, C. Pomerance, G. Tenenbaum, Grandes déviations pour certaines fonctions arithmétiques, J. Number Theory 40 (1992), 146-164. | MR 1149734 | Zbl 0745.11041

[2] L. Comtet, Analyse combinatoire, Tomes 1 et 2. Presses universitaires de France, 1970. | MR 262087 | Zbl 0221.05002

[3] H.H. Crapo, Permanent by Möbius inversion, Journal of Combinatorial Theory 4 (1968), 198-200. | MR 220613 | Zbl 0162.03201

[4] H.T. Davis, Table of the higher mathematical functions, The principia Press, Bloomington, Indiana, 1935, vol. 2. | Zbl 0013.21603

[5] M. Deléglise, Applications des ordinateurs à la théorie des nombres, Thèse Université de Lyon 1, 1991.

[6] P.D.T.A. Elliot, Probabilistic number theory, vol I and II, Grundlehren der Mathematischen Wissenschaften 239-240, Springer-Verlag, 1979. | MR 551361 | Zbl 0431.10029

[7] P. Flageolet, I. Vardi, Numerical evaluation of Euler products, Prepublication.

[8] W.L. Glaisher, On the sums of the inverse powers of the prime numbers, Quartely Journal of Math 25 (1891), 347-362. | JFM 23.0275.02

[9] G.H. Hardy and E.M. Wright, An introduction to the theory of numbers, Oxford at the Clarendon Press 1962. | MR 568909 | Zbl 0086.25803

[10] K.K. Norton, On the number of restricted prime factors of an integer, Illinois J. Math 20 (1976), 681-705. | MR 419382 | Zbl 0329.10035

[11] H. Riesel, Prime numbers and computer methods for factorization, Birkhaüser, 1985. | MR 897531 | Zbl 0582.10001