Largest prime factor
From MaRDI portal
Let \(P(n)\) be the largest prime factor of an integer \(n\), \(L(n)\) the number of \(k\leq n\) such that \(P(k)<\sqrt{k}\), and \(S(n)= \sum_{k=1}^ n P(k)/k\). The author proves that \(\lim(\log n/n)S(n)=\xi(2)\) and \(\lim 1/n L(n)=\log 2\). The methods used here are elementary.
Recommendations
Cites work
Cited in
(19)- On the largest prime factors of \(n\) and \(n+1\)
- Research notes on a density problem of Erdős
- On a problem of Erdős involving the largest prime factor of n
- The logarithm of the least prime factor. II.
- Logarithm of the greatest prime factor
- A note on the greatest prime factor
- Mertens' prime product formula, dissected
- The median largest prime factor
- scientific article; zbMATH DE number 6941958 (Why is no real title available?)
- Two remarks on the largest prime factors of \(n\) and \(n+1\)
- Series involving the least and the greatest prime factor of a natural number
- On the largest product of primes with bounded sum
- Le problème de Tchébychev pour le douzième polynôme cyclotomique
- The Most Frequent Values of the Largest Prime Divisor Function
- Random multiplicative walks on the residues modulo n
- The average largest prime factor
- On the set of the largest prime divisors
- On the largest prime factor of the partition function of \(n\)
- Large values and champion numbers of Kalmár's arithmetic function
This page was built for publication: Largest prime factor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687586)
