Erdős-Kac theorem for integer translates with k prime factors
For an integer number $n$, let $\omega(n)$ be its number of distinct prime factors. For $x\geqslant 1$, $k\geqslant 1$, $l\geqslant 0$, $1\leqslant v\leqslant x$ denote $$ \omega(n,v)=\sum_{p|n, p\leqslant v}1, \ \pi_k(x)=\#\{ n\leqslant x:\omega(n)=k\}, $$ $$ \pi_{k,l}(x,v)=\#\{n\leqslant x:\omega(n)=k,\omega(n-1,v)=l\}. $$ Author of the paper prove that $$ \pi_{k,l}(x,v)=\pi_k(x)\frac{(\log\log v)^l}{l!\log v}\left\{h_k\left(\frac{l}{\log\log v}\right) +O\left(\frac{k}{(\log\log x)^2}+\frac{l+1}{(\log\log v)^2}\right)\right\} $$ uniformly for $3\leqslant v\leqslant x^{\eta\log\log\log x/(R^2\log\log x)}$, $1\leqslant k\leqslant R\log\log x$, $0\leqslant l\leqslant R\log\log v$, where $\eta$ is an absolute constant, $R\geqslant 1$ is some fixed number and $h_k$ is some special function having the following representation $$ h_k(z)=\mathrm{e}^{\gamma(z-1)}\prod_{p\geqslant 2}\left(1+\frac{z-1}{p+(k-1)/\log\log x-1}\right)\left(1-\frac{1}{p}\right)^{z-1}. $$
- A New Proof of a Theorem of Van Der Corput
- Distribution of numbers with a given number of prime divisors in progressions
- scientific article; zbMATH DE number 3859240 (Why is no real title available?)
- scientific article; zbMATH DE number 473229 (Why is no real title available?)
- On a theorem of Erdös-Kac
- On the Distribution of Additive Number-Theoretic Functions (II)
- On the distribution of integers with a fixed number of prime factors
- Répartition Statistique Des Entiers Sans Grand Facteur Premier Dans Les Progressions Arithmétiques
This page was built for publication: Erdős-Kac theorem for integer translates with \(k\) prime factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291709)
