Integers with dense divisors. II
Let \(F(1)=1\), \(P^-(1)=\infty\), and, when \(n\geq 2\), \(P^-(n)= \min_{p|n}p\), \[ F(n)=\max\{dP^-(d): d|n,\;d>1\}. \] Define \(D(x.t), A(x ,t), E_\lambda(x)\), respectively, to be the number of positive integers \(n\leq x\) such that \(F(n)\leq nt\), \(F(n)\leq xt\), \(F(n)\leq n^{1+\lambda}\) where \(0<\lambda\leq 1\). In Part I [J. Number Theory 108, 1--17 (2004; Zbl 1055.11053)], the author pointed out that from earlier results of G. Tenenbaum and E. Saias it follows that when \(t= x^{1/w}\) for fixed \(w\geq 1\) \[ D(x,t)\sim A(x,t)\sim E_{1/w}(x)\sim xd(w) \] as \(x\to\infty\), where \(d(w)\) a certain continuous function on \(w\geq 1\). This is improved in the paper under review by allowing \(w=\frac{\log x}{\log t}\) to vary subject to \(x\geq t\geq\exp((\log\log x)^{\tfrac 53+ \varepsilon})\) with \(\varepsilon >0\), \(x\geq 3\), and by obtaining an error term \(O(\frac{x}{\log x})\). A key step is to derive an asymptotic formula for the number of integers contributing to \(A(x,t)\) that satisfy \(n=1\) or \(P^+(n):=\max_{p|n}p\leq y\) for \(n\geq 2\) where \(x\geq y\geq t\geq\exp ((\log\lg x)^{\tfrac 53+\varepsilon})\), \(\varepsilon>0\), \(x\geq 3\). The main term here involves a function \(a(u,w)\) with \(u=\frac{\log x} {\log y}\) that is defined by an integral equation, and some of its properties are established, including that \(0\leq a(u.w)\geq \rho(u)\) where \(\rho(u)\) denotes the Dickman function.
- scientific article; zbMATH DE number 166489
- Some asymptotic formulas on generalized divisor functions, III
- Integers with dense divisors 3
- On the density of certain sets of multiples. III
- scientific article; zbMATH DE number 3952878
- scientific article; zbMATH DE number 3539296
- Highest perfect power of a product of integers less than x
- scientific article; zbMATH DE number 4210254
- On the number of integers n such that nd(n) ≤ x
- scientific article; zbMATH DE number 1102616
- Applications des entiers à diviseurs denses
- Integers with dense divisors
- Integers with dense divisors. I
- Lois De Répartition Des Diviseurs, 5
- On the number of positive integers \(\leq x\) and free of prime factors \(>y\)
- On the small sieve. II: Sifting by composite numbers
- Study of the divisor graph. II
- Sur un problème de crible et ses applications
- Sur un problème de crible et ses applications. II. Corrigendum et étude du graphe divisoriel
- Lexicographic integers
- On a paper of Erdős and Szekeres
- On integers \(\leq x\) having more than \(\log x\) divisors
- Integers with dense divisors
- scientific article; zbMATH DE number 3170408 (Why is no real title available?)
- Integers with dense divisors 3
- Applications des entiers à diviseurs denses
- Study of the divisor graph 5
- Integers with dense divisors. I
- Nicolaas Govert de Bruijn, the enchanter of friable integers
This page was built for publication: Integers with dense divisors. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6230822)
