Integers with dense divisors. I (Q676288)

Let \(d_j(n)\), \(1\leq j\leq\tau(n)\), denote the positive divisors of \(n\) in increasing order, and put \(T(1)=1\), \(T(n)=\max_{1\leq i<\tau(n)} d_{i+1}(n)/d_i(n)\) \((n\geq 2)\). Write \(D(x,z)\) for the number of positive integers \(n\leq x\) with \(T(n)\leq z\) (i.e., the divisors of \(n\) are \(z\)-dense). The author proves that there exist positive constants \(c_1\) and \(c_2\) such that for \(x\geq z\geq 2\), \[ c_1 {x\log z\over\log x}\leq D(x,z)\leq c_2 {x\log z\over\log x}. \] This improves a result of \textit{G. Tenenbaum} [Ann. Sci. Éc. Norm. Supér., IV. Sér. 19, 1-30 (1986; Zbl 0599.10037); ibid. 28, 115-127 (1995; Zbl 0852.11048)]. An integer \(n\) is called a practical number if every integer \(m\) with \(1\leq m\leq\sigma(n)\) can be written in the form \(\sum^{\tau(n)}_{j=1} \varepsilon_jd_j(n)\) with \(\varepsilon_j\in\{0,1\}\) and \(d_j(n)\) as above. Denote the number of practical integers \(n\leq x\) by \(\text{PR}(x)\). It is shown that there exist positive constants \(c_3\) and \(c_4\) such that for \(x\geq 2\), \[ c_3 x/\log x\leq\text{PR}(x)\leq c_4x/\log x. \] The proofs are largely combinatorial in nature with delicate estimations, and depend on properties of the Dickman function \(\rho(u)\).