Question

$2$ cannot be a primitive root of a prime $F_n$

score 661 · Answer 1 · 2026-02-23 10:18:24

661

Views

$2$ cannot be a primitive root of a prime $F_n$

Published on 23 Feb 2026 - 10:18

score 312 · Answer 2 · 2017-12-17 21:38:00

312

Views

Solving a congruence using primitive roots

Published on 17 Dec 2017 - 21:38

score 113 · Answer 3 · 2026-03-29 17:30:37

113

Views

Index arithmetic for $9x^8 \equiv b \pmod{17}$

Published on 29 Mar 2026 - 17:30

score 243 · Answer 4 · 2017-12-21 18:13:51

243

Views

Primitive roots in integer rings of number fields with class number 1

Published on 21 Dec 2017 - 18:13

score 482 · Answer 5 · 2026-03-27 02:01:20

482

Views

Get primitive root of 1024 bit prime number in sage

Published on 27 Mar 2026 - 2:01

score 552 · Answer 6 · 2018-01-10 21:56:29

552

Views

Primitive element and choice of irreducible polynomial

Published on 10 Jan 2018 - 21:56

score 6.4k · Answer 7 · 2026-03-27 14:03:29

6.4k

Views

Prove sum of primitive roots congruent to $\mu(p-1) \pmod{p}$

Published on 27 Mar 2026 - 14:03

score 178.7k · Answer 8 · 2012-03-25 22:13:33

178.7k

Views

Finding a primitive root of a prime number

Published on 25 Mar 2012 - 22:13

score 11.2k · Answer 9 · 2012-07-05 05:31:46

11.2k

Views

Prove if $n$ has a primitive root, then it has exactly $\phi(\phi(n))$ of them

Published on 05 Jul 2012 - 5:31

score 441 · Answer 10 · 2013-02-05 18:03:50

441

Views

primitive roots of primes exercise ( is related to Sophie German theorem)

Published on 05 Feb 2013 - 18:03

score 267 · Answer 11 · 2020-08-16 04:38:59

267

Views

If $p$ is an odd prime and $\alpha\in\Bbb Z/p\Bbb Z^*$, then $\alpha^2$ is not a primitive root modulo $p$.

Published on 16 Aug 2020 - 4:38

score 94 · Answer 12 · 2020-08-19 13:21:56

94

Views

For prime $p \ge 5$ there exists an $n$ with $2 \le n \lt p -1$ with $[n]$ a primitive root of unity of $(\mathbb{Z}/{p^2}\mathbb{Z})^\times$.

Published on 19 Aug 2020 - 13:21

score 590 · Answer 13 · 2020-08-28 23:56:08

590

Views

Order of 2 modulo p, where p is a prime divisor of the Fermat number $F_n=2^{2^n}+1$

Published on 28 Aug 2020 - 23:56

score 361 · Answer 14 · 2020-08-29 21:22:51

361

Views

If r is a primitive root, then the residue of $r^t$ is also a primitive root if $\gcd(t,\phi(m))=1$ where $\phi$ is Euler's totient

Published on 29 Aug 2020 - 21:22

score 91 · Answer 15 · 2020-08-30 03:50:55

91

Views

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

Published on 30 Aug 2020 - 3:50

List Question

$2$ cannot be a primitive root of a prime $F_n$

Solving a congruence using primitive roots

Index arithmetic for $9x^8 \equiv b \pmod{17}$

Primitive roots in integer rings of number fields with class number 1

Get primitive root of 1024 bit prime number in sage

Primitive element and choice of irreducible polynomial

Prove sum of primitive roots congruent to $\mu(p-1) \pmod{p}$

Finding a primitive root of a prime number

Prove if $n$ has a primitive root, then it has exactly $\phi(\phi(n))$ of them

primitive roots of primes exercise ( is related to Sophie German theorem)

If $p$ is an odd prime and $\alpha\in\Bbb Z/p\Bbb Z^*$, then $\alpha^2$ is not a primitive root modulo $p$.

For prime $p \ge 5$ there exists an $n$ with $2 \le n \lt p -1$ with $[n]$ a primitive root of unity of $(\mathbb{Z}/{p^2}\mathbb{Z})^\times$.

Order of 2 modulo p, where p is a prime divisor of the Fermat number $F_n=2^{2^n}+1$

If r is a primitive root, then the residue of $r^t$ is also a primitive root if $\gcd(t,\phi(m))=1$ where $\phi$ is Euler's totient

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

Trending Questions

Popular # Hahtags

Popular Questions