Asymptotic behavior of composite numbers with three constrained prime factors of general type
The motivation from this work is the paper of \textit{Y. Hashimoto} [J. Math-for-Ind. 1, No. A, 45--49 (2009; Zbl 1198.94096)], where the author gave an asymptotic estimate for the counting function \N\[\N\pi_2(f,x):=\#\{n=p_1p_2\le x: p_2<p_2<f(p_1),~p_1,~p_2~{\text{prime}}\}, \N\]\Nwith \(f(x)>x\) is some function satisfying one of four growth conditions. The asymptotic depends on how fast \(f(x)\) tends to infinity relative to \(x\). More precisely, the result from [\textit{A. Decker} and \textit{P. Moree}, Result. Math. 52, No. 1--2, 35--39 (2008; Zbl 1177.11078)] is that \N\[\N\pi_2(f,x)\sim \begin{cases} \N\frac{x\log\log x}{\log x} &\text{if } (f(x)\gg \exp(\log x)^{\rho})\text{ for any }\rho>1),\\\N\left(1-\frac{1}{\rho}\right)\frac{x\log\log x}{\log x} &\text{if } (f(x)\sim c\exp(d(\log x)^{\rho})\text{ for some }\rho>1,~c>0,~d>0),\\\N(\log d) \frac{x}{\log x} &\text{if } (f(x)\sim cx^d\text{ for some }c>0,~d>1),\\\N2(\log c)\frac{x}{(\log x)^2} &\text{if } (f(x)\sim cx\text{ for some }c>1). \N\end{cases} \N\]\NIn the paper under review the authors study \N\[\N\pi_{3,j}(f,x):=\# \{n=p_1p_2p_3: p_1<p_2<p_3<f(p_j),~p_1,p_2,p_3 ~{\text{prime}}\}\qquad {\text{for}}\quad j=1,2. \N\]\NTheir function \(f\) satisfies one of the four growth conditions from Hashimoto's paper. There are two theorems, namely Theorem 1.4 and Theorem 1.5, which give asymptotics for \(\pi_{3,1}(f,x)\) and \(\pi_{3,2}(f,x)\), respectively \(x\) tends to infinity. The proofs use the prime number theorem, Landau's theorem to count the numbers of positive integers \(n\le x\) with two or three prime factors (without any restrictions on their sizes), as well as calculations with integrals.
This page was built for publication: Asymptotic behavior of composite numbers with three constrained prime factors of general type
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589619)
