List questions from primitive-roots

Published on 28 Jan 2015 - 7:18

1.6k

Views

If $r$ is a primitive root of odd prime $p$, prove that $\text{ind}_r (-1) = \frac{p-1}{2}$

Published on 29 Jan 2015 - 5:29

1.5k

Views

Discrete Logarithm Problem

Published on 30 Jan 2015 - 5:19

104

Views

Concerning Primitive roots and exponents.

Published on 28 Mar 2026 - 20:51

735

Views

The primitive root of modulo 109

Published on 28 Mar 2026 - 0:54

48

Views

Long division to primitive roots?

Published on 05 Feb 2015 - 8:38

178

Views

Primitive roots modulo primes congruent to n!

Published on 11 Feb 2015 - 1:54

34

Views

Primitive roots in $\mathbb{F}_7[x]/(x^2+1)$

Published on 11 Feb 2015 - 2:24

202

Views

Properties of square roots

Published on 20 Feb 2015 - 6:08

56

Views

Show that $[-a^2]$ generates Up

Published on 24 Feb 2015 - 0:40

297

Views

Let $p$ be a prime of the form $p=2^k+1$. Prove that $\mathbb{Z}_p$ has $2^{k-1}$ primitive roots.

Published on 05 Mar 2015 - 22:18

265

Views

Count of lower and upper primitive roots of prime $p \equiv 3 \bmod 4$

Published on 12 Mar 2015 - 8:58

275

Views

primitive roots problem. that integer n can never have exactly 26 primitive roots.

Published on 12 Mar 2015 - 9:46

565

Views

Determine the number of solutions of $x^p\equiv 1\mod p^h$ using primitive roots

Published on 20 Mar 2015 - 13:36

230

Views

How do I prove this statement about $n^\text{th}$-power residues?

Published on 25 Mar 2026 - 6:11

List Question

Primitive roots and 'equivalent exponents'.

If $r$ is a primitive root of odd prime $p$, prove that $\text{ind}_r (-1) = \frac{p-1}{2}$

Discrete Logarithm Problem

Concerning Primitive roots and exponents.

The primitive root of modulo 109

Long division to primitive roots?

Primitive roots modulo primes congruent to n!

Primitive roots in $\mathbb{F}_7[x]/(x^2+1)$

Properties of square roots

Show that $[-a^2]$ generates Up

Let $p$ be a prime of the form $p=2^k+1$. Prove that $\mathbb{Z}_p$ has $2^{k-1}$ primitive roots.

Count of lower and upper primitive roots of prime $p \equiv 3 \bmod 4$

primitive roots problem. that integer n can never have exactly 26 primitive roots.

Determine the number of solutions of $x^p\equiv 1\mod p^h$ using primitive roots

How do I prove this statement about $n^\text{th}$-power residues?

Trending Questions

Popular # Hahtags

Popular Questions