The number of preimages of iterates of $ϕ$ and $σ$

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteur principal: Akande, Agbolade Patrick
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866916084463960064
author Akande, Agbolade Patrick
author_facet Akande, Agbolade Patrick
contents Paul Erdos and Carl Pomerance have proofs on an asymptotic upper bound on the number of preimages of Euler's totient function $ϕ$ and the sum-of-divisors functions $σ$. In this paper, we will extend the upper bound to the number of preimages of iterates of $ϕ$ and $σ$. Using these new asymptotic upper bounds, a conjecuture in Konick and Katai's paper, "On the uniform distribution of certain sequences involving the Euler totient function and the sum of divisors function" is now proven and many corollaries follow from their proven conjecture.
format Preprint
id arxiv_https___arxiv_org_abs_2401_04073
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle The number of preimages of iterates of $ϕ$ and $σ$
Akande, Agbolade Patrick
Number Theory
Paul Erdos and Carl Pomerance have proofs on an asymptotic upper bound on the number of preimages of Euler's totient function $ϕ$ and the sum-of-divisors functions $σ$. In this paper, we will extend the upper bound to the number of preimages of iterates of $ϕ$ and $σ$. Using these new asymptotic upper bounds, a conjecuture in Konick and Katai's paper, "On the uniform distribution of certain sequences involving the Euler totient function and the sum of divisors function" is now proven and many corollaries follow from their proven conjecture.
title The number of preimages of iterates of $ϕ$ and $σ$
topic Number Theory
url https://arxiv.org/abs/2401.04073