List questions from totient-function

Published on 03 Jul 2016 - 19:46

3.2k

Views

Infinitely many positive integers $n$ such that $\phi(n) = \frac{n}{4}$?

Published on 27 Mar 2026 - 18:56

1.5k

Views

Find all the natural numbers where $ϕ(n)=110$ (Euler's totient function)

Published on 19 Apr 2013 - 13:07

599

Views

Maximum of $\frac{\phi(i)}i$

Published on 04 May 2013 - 10:29

1.2k

Views

Euler's totient function maximum value for a range

Published on 05 May 2013 - 8:00

638

Views

Convert this intuitive explanation of Euler's Totient function into a proof

Published on 07 May 2013 - 19:50

1.3k

Views

Show that the only solution to $\phi(n) =n-2$ is $n=4$

Published on 16 May 2013 - 11:32

197

Views

how prove $\phi(n)\ge \frac{n}{6\log \log (n)} $ $\forall n\ge5 $

Published on 20 May 2013 - 19:17

11.3k

Views

$n$ divides $\phi(a^n -1)$ where $a, n$ are positive integer.

Published on 21 May 2013 - 13:10

113

Views

Any way to simplify this gcd totient function

Published on 21 May 2013 - 13:57

880

Views

Does Euler totient function gives exactly one value(answer) or LEAST calculated value(answer is NOT below this value)?

Published on 23 May 2013 - 20:17

478

Views

How prove that:$\varphi(2)+\varphi(3)+\varphi(4)+\cdots+\varphi(n)\ge\frac{n(n-1)}{4}+1$

Published on 04 Jun 2013 - 2:01

215

Views

Values of the Euler-Phi function

Published on 09 Jun 2013 - 20:26

132

Views

Prove that we always have $ 2n \mid \varphi(m^n+p^n) $

Published on 15 Jun 2013 - 13:42

6.4k

Views

Prove $n\mid \phi(2^n-1)$

Published on 15 Jun 2013 - 14:26

List Question

Find all the numbers $n$ such that $\varphi(n)=5$

Infinitely many positive integers $n$ such that $\phi(n) = \frac{n}{4}$?

Find all the natural numbers where $ϕ(n)=110$ (Euler's totient function)

Maximum of $\frac{\phi(i)}i$

Euler's totient function maximum value for a range

Convert this intuitive explanation of Euler's Totient function into a proof

Show that the only solution to $\phi(n) =n-2$ is $n=4$

how prove $\phi(n)\ge \frac{n}{6\log \log (n)} $ $\forall n\ge5 $

$n$ divides $\phi(a^n -1)$ where $a, n$ are positive integer.

Any way to simplify this gcd totient function

Does Euler totient function gives exactly one value(answer) or LEAST calculated value(answer is NOT below this value)?

How prove that:$\varphi(2)+\varphi(3)+\varphi(4)+\cdots+\varphi(n)\ge\frac{n(n-1)}{4}+1$

Values of the Euler-Phi function

Prove that we always have $ 2n \mid \varphi(m^n+p^n) $

Prove $n\mid \phi(2^n-1)$

Trending Questions

Popular # Hahtags

Popular Questions