- Analytic Number Theory
- Chebyshev functions
- Complex Analysis
- Dirichlet product
- Dirichlet series
- Divisor function
- Euler's totient function
- Little Picard theorem
- Möbius function
- Multiplicative functions
- Prime number theorem
- Ramanujan's sum
- Riemann zeta function
- Summation by parts
- Uncategorized
- Von Mangoldt function
abscissa of convergence Blaschke factors Borel-Carathéodory lemma bounds Cauchy's theorem characteristic function of divisors Chebyshev function Dirichlet series divisor function entire function Euler's totient function holomorphic function Jensen's inequality Kronecker's lemma Menon's identity Möbius function Picard theorem prime number theorem Ramanujan's sum Riemann zeta function summation by parts units zero-free region
Category Archives: Euler’s totient function
Bounds for divisor and Euler’s totient function
The divisor function $d(n)$ counts the number of divisors of an integer $n$. It is a multiplicative function and so can be written as\[d(n) = \prod_{p^a || n} (a + 1).\] We will now show that $d(n) \ll_{\varepsilon} n^{\varepsilon}$ for … Continue reading
Lifting of units and Menon’s identity
Let $d$ be a divisor of $n$. It is natural to ask the following question: Does a unit $a$ modulo $d$ lifts to a unit modulo $n$, i.e., if $a$ is a unit modulo $d$, then does there exist a … Continue reading
Posted in Euler's totient function
Tagged Euler's totient function, Menon's identity, units
Leave a comment
Euler’s totient function
The Euler’s totient function, denoted $\varphi$ (or $\phi$), is defined at $n$ to be the number of positive integers not exceeding $n$ that are relatively prime to $n$. We can rewrite $\varphi(n)$ in the summation notation as\[\varphi(n) = \sum_{\scriptstyle k … Continue reading