Questions on the totient function $\phi(n)$ (sometimes $\varphi(n)$) of Euler, the function that counts the number of positive integers relatively prime to and less than or equal to $n$.
Stats
created |
1 year ago |
viewed |
4 times |
editors |
1 |
Recent Hot Answers
Identity involving Euler's totient function: $\sum \limits_{k=1}^n \left\lfloor \frac{n}{k} \right\rfloor \varphi(k) = \frac{n(n+1)}{2}$Prove $\sum\limits_{n\leq x} \frac{n}{\phi(n)} =O(x) $
How can I show $e^2 \equiv 1 \bmod 24$, given that $\gcd(e, 24) = 1$?
Proof $\binom{2\phi(r)}{\phi(r)+1} \geq 2^{\phi(r)}$
Why does $\phi(pq)=\phi(p)\phi(q)$?
more »
Related Tags
elementary-number-theory × 36number-theory × 24
prime-numbers × 8
modular-arithmetic × 4
homework × 3
factoring × 3
analytic-number-theory × 2
cryptography × 2
reference-request × 2
proof-strategy × 2
optimization
asymptotics
binomial-coefficients
inequality
divisor-sum
abstract-algebra
discrete-mathematics
functional-equations
arithmetic-functions
sieve-theory
prime-twins
induction
coding-theory
arithmetic
summation
