Answers are grounded in this paper and cite their sources.
This analysis investigates divisibility and sequence properties of sigma and totient functions, indicating significant patterns.
Inspired by Lehmer’s and Deaconescu’s conjectures, as well as various analogue problems concerning Euler’s totient function φ(n), Schemmel’s totient function S₂(n), Jordan totient function Jₖ, and the unitary totient function φ*(n), we investigate analogous divisibility problems involving the functions σ(n), σ⁺(n), and φ⁺(n). Further, we establish some interesting properties of the sequences {σ⁺(n)}ₙ₌₁^∞ and {φ⁺(n)}ₙ₌₁^∞, in particular, we prove that each of these sequences contains infinitely many arithmetic progressions of length 3.
No takes yet. Share an insight, caveat, or question.
Sagar Mandal (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: