On Lehmer's problem and related problems

MaRDI QIDQ6431319zbMATH OpenFDO

Authors Tomohiro Yamada

Publication date 29 March 2023

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Distribution of integers with specified multiplicative constraints (11N25)

Abstract: We show that if $Npm1=Mvarphi(N)$, then $M<15.76515logloglogN$ and $M<16.03235loglogomega(N)$, together with similar results for the unitary totient function, Dedekind function, and the sum of unitary divisors.

This page was built for publication: On Lehmer's problem and related problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6431319)