English

An Arithmetic Function Arising from the Dedekind $\psi$ Function

Number Theory 2015-01-08 v2

Abstract

We define ψ\overline{\psi} to be the multiplicative arithemtic function that satisfies ψ(pα)={pα1(p+1),\mboxifp2;pα1,\mboxifp=2\overline{\psi}(p^{\alpha})=\begin{cases} p^{\alpha-1}(p+1), & \mbox{if } p\neq 2; \\ p^{\alpha-1}, & \mbox{if } p=2 \end{cases} for all primes pp and positive integers α\alpha. Let λ(n)\lambda(n) be the number of iterations of the function ψ\overline{\psi} needed for nn to reach 22. It follows from a theorem due to White that λ\lambda is additive. Following Shapiro's work on the iterated φ\varphi function, we determine bounds for λ\lambda. We also use the function λ\lambda to partition the set of positive integers into three sets S1,S2,S3S_1,S_2,S_3 and determine some properties of these sets.

Keywords

Cite

@article{arxiv.1501.00971,
  title  = {An Arithmetic Function Arising from the Dedekind $\psi$ Function},
  author = {Colin Defant},
  journal= {arXiv preprint arXiv:1501.00971},
  year   = {2015}
}

Comments

13 pages, 0 figures

R2 v1 2026-06-22T07:51:39.528Z