Question

Why is it sufficient to only check ${s/p_i}$ powers in finding primitive root?

score 47 · Answer 1 · 2026-03-25 15:22:47

47

Views

Why is it sufficient to only check ${s/p_i}$ powers in finding primitive root?

Published on 25 Mar 2026 - 15:22

score 500 · Answer 2 · 2019-06-18 21:26:07

500

Views

How does one prove that $1 + a + a^2 + ... +a^{\phi(n)-1} = 0$ mod $n$ if $a$ and $a-1$ are both units mod n?

Published on 18 Jun 2019 - 21:26

score 229 · Answer 3 · 2019-06-19 03:13:25

229

Views

Questions about invertion of Euler's totient function

Published on 19 Jun 2019 - 3:13

score 171 · Answer 4 · 2019-06-19 15:18:16

171

Views

RSA with small encryption exponent

Published on 19 Jun 2019 - 15:18

score 338 · Answer 5 · 2019-06-21 15:43:30

338

Views

Modular exponentiation using Euler's totient function

Published on 21 Jun 2019 - 15:43

score 373 · Answer 6 · 2019-06-24 11:26:31

373

Views

Prove that $\phi (p-1) \leq (p-1)/2$, where $p\geq 3$ is a prime

Published on 24 Jun 2019 - 11:26

score 222 · Answer 7 · 2026-03-26 06:17:43

222

Views

Does entropy increase when multiplying two numbers?

Published on 26 Mar 2026 - 6:17

score 273 · Answer 8 · 2019-06-27 17:42:58

273

Views

Sum of quotient of Euler phi functions

Published on 27 Jun 2019 - 17:42

score 49 · Answer 9 · 2019-06-29 09:09:26

49

Views

The sequence $a(n)=\sum_{k=2}^n \varphi(k)$ has much primes, as expected

Published on 29 Jun 2019 - 9:09

score 145 · Answer 10 · 2026-03-25 09:39:44

145

Views

Questions on Riemann Hypothesis prediction and explicit formula for $\hat{\Phi}(x)=\sum\limits_{n\le x}\frac{\phi(n)}{n}$

Published on 25 Mar 2026 - 9:39

score 657 · Answer 11 · 2019-07-01 14:59:25

657

Views

Group $U(n)$ closed under modular multiplication with every element is its own inverse

Published on 01 Jul 2019 - 14:59

score 190 · Answer 12 · 2026-03-25 15:28:11

190

Views

Prove that numbers relatively prime to $n$ are congruent modulo $n$ to powers of primitive root of $n$

Published on 25 Mar 2026 - 15:28

score 814 · Answer 13 · 2019-07-05 13:27:41

814

Views

Why Euler's Totient function is important?

Published on 05 Jul 2019 - 13:27

score 124 · Answer 14 · 2026-03-25 20:12:45

124

Views

Is it possible to improve on the bounds for $\varphi(N)/N$, if $N = q^k n^2$ is an odd perfect number with special prime $q$?

Published on 25 Mar 2026 - 20:12

score 121 · Answer 15 · 2019-07-06 14:01:00

121

Views

How to calculate the Pillai function

Published on 06 Jul 2019 - 14:01

List Question

Why is it sufficient to only check ${s/p_i}$ powers in finding primitive root?

How does one prove that $1 + a + a^2 + ... +a^{\phi(n)-1} = 0$ mod $n$ if $a$ and $a-1$ are both units mod n?

Questions about invertion of Euler's totient function

RSA with small encryption exponent

Modular exponentiation using Euler's totient function

Prove that $\phi (p-1) \leq (p-1)/2$, where $p\geq 3$ is a prime

Does entropy increase when multiplying two numbers?

Sum of quotient of Euler phi functions

The sequence $a(n)=\sum_{k=2}^n \varphi(k)$ has much primes, as expected

Questions on Riemann Hypothesis prediction and explicit formula for $\hat{\Phi}(x)=\sum\limits_{n\le x}\frac{\phi(n)}{n}$

Group $U(n)$ closed under modular multiplication with every element is its own inverse

Prove that numbers relatively prime to $n$ are congruent modulo $n$ to powers of primitive root of $n$

Why Euler's Totient function is important?

Is it possible to improve on the bounds for $\varphi(N)/N$, if $N = q^k n^2$ is an odd perfect number with special prime $q$?

How to calculate the Pillai function

Trending Questions

Popular # Hahtags

Popular Questions