A weighted version of the Erdős-Kac theorem (Q2671990): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jnt.2021.10.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3182744707 / rank
 
Normal rank

Revision as of 23:52, 19 March 2024

scientific article
Language Label Description Also known as
English
A weighted version of the Erdős-Kac theorem
scientific article

    Statements

    A weighted version of the Erdős-Kac theorem (English)
    0 references
    0 references
    0 references
    0 references
    8 June 2022
    0 references
    Let \(\tau_k(n)=\sum_{n_1\cdots n_k=n}1\) be the \(k\)-fold divisor function, and \(\omega(n)=\sum_{p|n}1\) denotes the number of distinct prime divisors of \(n\). In the paper under review, the authors approximate the weighted moments \(\sum_{n\leq x}(\omega(n)-k\log\log x)^m\tau_k(n)\), and as a corollary show the following weighted version of the Erdős-Kac Theorem \[ \lim_{x\to\infty}\frac{1}{\sum_{n\leq x}\tau_k(n)}\sum_{\substack{n\leq x\\ \omega(n)-k\log\log x\leq\alpha\sqrt{k\log\log x}}}\tau_k(n)=\frac{1}{\sqrt{2\pi}}\int_{-\infty}^\alpha e^{-t^2/2}dt, \] where \(k\) is fixed positive integer, and \(\alpha\) is any arbitrary real.
    0 references
    0 references
    Erdős-Kac theorem
    0 references
    prime omega function
    0 references
    divisor function
    0 references
    central limit theorem
    0 references
    moments
    0 references

    Identifiers