Arithmetic functions monotonic at consecutive arguments
For a large class of arithmetic functions \(f\), it is possible to show that, given an arbitrary integer \(k \geq 2,\) the string of inequalities \(f(n+1)< f(n+2) < \dots< f(n+k)\) holds for infinitely many positive integers \(n\). For instance, the authors have shown in their recent book that for Euler's function \(\varphi\), given any integer \(k \geq 2\), \(\varphi(n+1)< \varphi(n+2) < \dots< \varphi(n+k)\) holds for infinitely many positive integers \(n\). The same type of statement can be made for sum of divisors function \(\sigma(n)\). Besides these and other multiplicative functions, similar statements can be made for additive functions. For instance, \textit{J.-M. De Koninck, J. B. Friedlander} and \textit{F. Luca} [Proc. Am. Math. Soc. 137, No. 5, 1585--1592 (2009; Zbl 1184.11046)] have proved that, given any integer \(k \geq 2,\) and setting \(g(n)=\sum_{p| n}1\) or \(g(n)=\sum_{p^{\alpha}\| n} \alpha,\) then \(g(n+1)< g(n+2) < \dots< g(n+k)\) holds infinitely often. For other arithmetic functions \(f\) such a property fails to hold even for \(k=3\). In this paper arithmetic functions from both classes have been examined. In particular, it is shown that there are only finitely many values of \(n\) satisfying \(\sigma_{2}(n-1)<\sigma_{2}(n)<\sigma_{2}(n+1),\) where \( \sigma_{2}(n)= \sum_{d| n}d^{2}\). On the other hand, it is proved that for the function \(f(n)= \sum_{p| n}p^{2}\), we have \(f(n-1)< f(n)<f(n+1)\) infinitely often. It is also mentioned that using the approach used in the proof one can prove that the string of inequalities \(\sigma_{k}(n-1)<\sigma_{k}(n)<\sigma_{k}(n+1),\) where \( \sigma_{k}(n)= \sum_{d| n}d^{k}\), also fails to hold infinitely often for all real \(k>1.1905\).
This page was built for publication: Arithmetic functions monotonic at consecutive arguments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875467)
