An analog of perfect numbers involving the unitary totient function

DOI10.1016/j.jnt.2019.08.020zbMath1464.11003arXiv1806.00647OpenAlexW2805077386WikidataQ114157225 ScholiaQ114157225MaRDI QIDQ2288312

Tomohiro Yamada

Publication date: 17 January 2020

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.00647

zbMATH Keywords

sieve methodsarithmetic functionsunitary divisorLehmer's problemEuler totientJordan totient

Mathematics Subject Classification ID

Applications of sieve methods (11N36) Arithmetic functions; related numbers; inversion formulas (11A25) Factorization; primality (11A51) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On divisors of Lucas and Lehmer numbers
• Some analogues of a Lehmer problem on the totient function
• On groups with perfect order subsets
• Approximate formulas for some functions of prime numbers
• Distribution of zeros of Dirichlet L-functions and an explicit formula for ψ(t, χ)
• EXPLICIT ZERO‐FREE REGIONS FOR DIRICHLET ‐FUNCTIONS
• Odd perfect numbers have a prime factor exceeding $10^8$
• On Fermat's Quotient, Base Two
• The large sieve
• On Euler’s totient function
• A Curious Connection between Fermat Numbers and Finite Groups
• A variant of the Bombieri-Vinogradov theorem with explicit constants and applications
• Sätze über Kreisteilungspolynome und ihre Andwendungen auf einige zahlentheoretische Probleme. I.