On an arithmetic function considered by Pillai
From MaRDI portal
(Redirected from Publication:988071)
Given an integer \(n> 1\), let \(p(n)\) be the largest prime number, that is \(\leq n\). \textit{S. Pillai} [Journal Annamalai Univ. 1, 159--167 (1932; JFM 58.1038.02)] defined recursively an arithmetic function \(R(n): n_1= n\), \(n_{k+1}= n_k- p(n_k)\) if \(n_k> 1\); put \(R(n)= k\) if \(n_k\) is prime or \(1\). The authors generalize estimations of Pillai. They show \(R(n): O(\log\log n)\) and \(\#\{n\leq x: R(n)= k\}\asymp{x\over\log_k x}\) for every fixed integer \(k\geq 1(\log_k x\) is the iterated logarithm).
Recommendations
- On a certain arithmetic function
- scientific article; zbMATH DE number 3249863
- scientific article; zbMATH DE number 2143749
- scientific article; zbMATH DE number 1985605
- scientific article; zbMATH DE number 4106941
- scientific article; zbMATH DE number 3979174
- scientific article; zbMATH DE number 700516
- The unitary analogue of Pillai's arithmetical function
- Note on a Class of Arithmetical Functions
Cites work
Cited in
(9)- Analytic number theory in India during 2001-2010
- Making change in 2048
- Unique representation of integers with base \(A\)
- Prime number conjectures from the Shapiro class structure
- An arithmetic function decreasing the natural numbers
- The prime-power map
- Counting solutions without zeros or repetitions of a linear congruence and rarefaction in \(b\)-multiplicative sequences
- On a sequence of densities generated by the greedy algorithm
- The unitary analogue of Pillai's arithmetical function
This page was built for publication: On an arithmetic function considered by Pillai
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q988071)
