List questions from primitive-roots

Published on 04 Sep 2013 - 22:58

828

Views

Primitives and minimal polynomials

Published on 07 Oct 2013 - 21:42

272

Views

Primitive Root Modulo $m$

Published on 12 Oct 2013 - 0:29

649

Views

Show that $α^k$ is also a primitive element if and only if gcd$(k, q − 1) = 1$.

Published on 21 Oct 2013 - 16:49

1k

Views

Number Theory Help: Eulers phi function, LCM, and Modulos

Published on 04 Nov 2013 - 19:07

1.5k

Views

Sums of Primitive Roots and Quadratic Residues when $p \equiv 3\pmod 4$

Published on 29 Mar 2026 - 3:36

2.1k

Views

Proofs with primitive roots

Published on 12 Nov 2013 - 18:29

463

Views

Primitive Root Proof

Published on 12 Nov 2013 - 19:17

72

Views

Prove that if $2^{4\times5^k}=x\times5^{k+3}+a,0<a<5^{k+3},$ then $5\mid x$

Published on 20 Nov 2013 - 5:09

2.3k

Views

Primitive Roots Proofs

Published on 25 Nov 2013 - 2:01

3.6k

Views

integer $m$ has primitive root if and only if the only solutions of the congruence $x^{2} \equiv 1 \pmod m$ are $x \equiv \pm 1\pmod m$.

Published on 28 Nov 2013 - 19:34

9.1k

Views

Relationship between primitive roots and quadratic residues

Published on 29 Mar 2026 - 4:09

2.4k

Views

Prove that if g is a primitive root modulo p (p is an odd prime), then g belongs to h modulo $p^m$, where $h=(p-1)p^r$ for some r.

Published on 03 Dec 2013 - 13:39

2.1k

Views

2 is a primitive root mod $3^h$ for any positive integer $h$

Published on 05 Dec 2013 - 23:15

234

Views

Primitive roots and Discrete logarithms question

Published on 15 Dec 2013 - 16:44

List Question

Counting Primitive Roots modulo a prime with Totient Function

Primitives and minimal polynomials

Primitive Root Modulo $m$

Show that $α^k$ is also a primitive element if and only if gcd$(k, q − 1) = 1$.

Number Theory Help: Eulers phi function, LCM, and Modulos

Sums of Primitive Roots and Quadratic Residues when $p \equiv 3\pmod 4$

Proofs with primitive roots

Primitive Root Proof

Prove that if $2^{4\times5^k}=x\times5^{k+3}+a,0<a<5^{k+3},$ then $5\mid x$

Primitive Roots Proofs

integer $m$ has primitive root if and only if the only solutions of the congruence $x^{2} \equiv 1 \pmod m$ are $x \equiv \pm 1\pmod m$.

Relationship between primitive roots and quadratic residues

Prove that if g is a primitive root modulo p (p is an odd prime), then g belongs to h modulo $p^m$, where $h=(p-1)p^r$ for some r.

2 is a primitive root mod $3^h$ for any positive integer $h$

Primitive roots and Discrete logarithms question

Trending Questions

Popular # Hahtags

Popular Questions