Distribution mod p of Euler’s Totient and the Sum of Proper Divisors
Noah Lebowitz-Lockard, Paul Pollack, Akash Singha Roy
Abstract
Open-access reader
Noah Lebowitz-Lockard, Paul Pollack, Akash Singha Roy
Abstract
Open-access reader
We consider the distribution in residue classes modulo primes p of Euler’s totient function ϕ(n) and the sum-of-proper-divisors function s(n):=σ(n)−n. We prove that the values of ϕ(n) for n≤x that are coprime to p are asymptotically uniformly distributed among the p−1 coprime residue classes modulo p, uniformly for 5≤p≤(logx)A (with A fixed but arbitrary). We also show that the values of s(n) for n composite are uniformly distributed among all p residue classes modulo every p≤(logx)A. These appear to be the first results of their kind where the modulus is allowed to grow substantially with x.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We consider the distribution in residue classes modulo primes p of Euler’s totient function ϕ(n) and the sum-of-proper-divisors function s(n):=σ(n)−n. We prove that the values of ϕ(n) for n≤x that are coprime to p are asymptotically uniformly distributed among the p−1 coprime residue classes modulo p, uniformly for 5≤p≤(logx)A (with A fixed but arbitrary). We also show that the values of s(n) for n composite are uniformly distributed among all p residue classes modulo every p≤(logx)A. These appear to be the first results of their kind where the modulus is allowed to grow substantially with x.
Key concepts: Euler's totient function, Modulo, Mathematics, Coprime integers, Primitive root modulo n, Residue (chemistry), Combinatorics, Distribution (mathematics)