On limiting distributions of arithmetic functions
The author studies the average orders of arithmetical functions \(h(n)\) and \(H(n)\), which are the minimum resp. maximum exponents of \(n\), i.e., the smallest, resp. greatest exponents in the prime factorization of \(n\). These arithmetical functions were introduced and studied for the first time by I. Niven in 1969. (For many results on these arithmetical functions , see the monograph by \textit{J. Sándor} and \textit{B. Crstici} [Handbook of number theory II. Dordrecht: Kluwer Academic Publishers. 330--332 (2004; Zbl 1079.11001)]). The author proves that \(\sum_{n\le x}(h(n)^{2}= x+cx^{1/2} +dx^{1/3}+ O(x^{1/4})\), where \(c\) and \(d\) are explicit positive constants, and that \(\sum_{n\le x}(H(n))^{2} = Bx + O(x^{1/2})\), where \(B\) is a positive constant. It is also proved that, the limiting distribution of \(h(n)\) is the degenerate distribution, and that \(H(n)\) satisfies the arithmetic \(k\)-distribution, where \(k(n)=0\) for \(n=0,1\) and \(1/\zeta(n)\) otherwise.
- Average orders of certain arithmetical functions
- Averages of Exponents in Factoring Integers
- Distribution of the number of prime factors with a given multiplicity
- scientific article; zbMATH DE number 38472 (Why is no real title available?)
- scientific article; zbMATH DE number 3235403 (Why is no real title available?)
- scientific article; zbMATH DE number 3339576 (Why is no real title available?)
- Number of prime factors with a given multiplicity
- On the maximum and minimum exponents in factoring integers
- The distribution of powerful integers
- The Gaussian Law of Errors in the Theory of Additive Number Theoretic Functions
- The number of prime factors on average in certain integer sequences
This page was built for publication: On limiting distributions of arithmetic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932023)