List questions from totient-function

Published on 30 Mar 2026 - 3:20

116

Views

Do primitive roots mod m always satisfy $\gcd(r^t,m)=1$?

Published on 30 Mar 2026 - 5:02

553

Views

Euler totient function for Gaussian integers

Published on 26 Mar 2026 - 9:45

61

Views

Order of product versus product of orders

Published on 03 Sep 2020 - 9:54

123

Views

Finding the remainder of $7^{27}\mod 11$

Published on 09 Sep 2020 - 8:48

131

Views

Introduction to Euler's Phi Function

Published on 17 Sep 2020 - 11:30

83

Views

A Question Regarding Euler's Phi Function and Composite $N$

Published on 27 Mar 2026 - 12:08

133

Views

Modular inverse by Euler's theorem for Gaussian integers

Published on 26 Mar 2026 - 9:37

86

Views

I want to show that $x=\operatorname{ord}(a) \bmod m$ and $y=\operatorname{ord}(b)\bmod m$ then $\operatorname{ord}(ab)\equiv xy \pmod{\phi(m)}$

Published on 25 Sep 2020 - 13:19

1.9k

Views

Prove that there are no composite integers $n=am+1$ such that $m \ | \ \phi(n)$

Published on 28 Sep 2020 - 7:56

653

Views

Number of positive integers $\le n$ which are a multiple of $p$

Published on 10 Oct 2020 - 5:16

402

Views

Calculating a sum with Euler's totient function

Published on 12 Oct 2020 - 15:43

295

Views

How can we prove that there are no other integers with $\phi(n)=2$ besides 3,4,6?

Published on 13 Oct 2020 - 21:01

42

Views

If $n$ is an even natural number then $2^{n-1}$ is divisible for $2^{\varphi(n)}$?

Published on 17 Oct 2020 - 16:09

115

Views

Find $m \in \mathbb{N}$ such that $\varphi(m)$ is a prime number.

Published on 17 Oct 2020 - 17:59

List Question

If r is a primitive root mod m, then r is a primitive root $\pmod{\phi(m)}$?

Do primitive roots mod m always satisfy $\gcd(r^t,m)=1$?

Euler totient function for Gaussian integers

Order of product versus product of orders

Finding the remainder of $7^{27}\mod 11$

Introduction to Euler's Phi Function

A Question Regarding Euler's Phi Function and Composite $N$

Modular inverse by Euler's theorem for Gaussian integers

I want to show that $x=\operatorname{ord}(a) \bmod m$ and $y=\operatorname{ord}(b)\bmod m$ then $\operatorname{ord}(ab)\equiv xy \pmod{\phi(m)}$

Prove that there are no composite integers $n=am+1$ such that $m \ | \ \phi(n)$

Number of positive integers $\le n$ which are a multiple of $p$

Calculating a sum with Euler's totient function

How can we prove that there are no other integers with $\phi(n)=2$ besides 3,4,6?

If $n$ is an even natural number then $2^{n-1}$ is divisible for $2^{\varphi(n)}$?

Find $m \in \mathbb{N}$ such that $\varphi(m)$ is a prime number.

Trending Questions

Popular # Hahtags

Popular Questions