In this paper we present some interesting connections between primitive roots and quadratic non-residues modulo a prime. Using these correlations, we propose some polynomial deterministic algorithms for generating primitive roots for primes with special forms (for example, for safe primes)
This note is devoted to studying quadratic nonresidues attached to certain binary representations of...
AbstractFor an odd prime p, let l(p) denote the least positive prime which is a quadratic residue mo...
This paper studies the distinctness of primitive sequences over Z/(M) modulo 2, where M is an odd in...
summary:In this article we study, using elementary and combinatorial methods, the distribution of qu...
summary:In this article we study, using elementary and combinatorial methods, the distribution of qu...
AbstractIn this paper it is shown that if p = 4k + 1 is a prime such that ϕ(p − 1)(p − 1) > 14, then...
summary:We examine primitive roots modulo the Fermat number $F_m=2^{2^m}+1$. We show that an odd int...
summary:We examine primitive roots modulo the Fermat number $F_m=2^{2^m}+1$. We show that an odd int...
AbstractWe address the problem of taking cube roots modulo an integer. We generalize two of the fast...
AbstractIn this paper it is shown that the number of pairs of consecutive primitive roots modulo p i...
Abstract For primes p, the multiplicative group of reduced residues modulo p is cyclic, with cyclic ...
Let $p$ be a prime. If an integer $g$ generates a subgroup of index $t$ in $(\mathbb Z/p\mathbb Z)^*...
The aim of this thesis is to lower the bound on square-free primitive roots modulo primes. Let g2(p)...
Includes bibliographical references.In this paper a study is first made of the congruence xⁿ ≡ b mod...
AbstractTwo conjectures about primitive roots are given. These conjectures are supported by empirica...
This note is devoted to studying quadratic nonresidues attached to certain binary representations of...
AbstractFor an odd prime p, let l(p) denote the least positive prime which is a quadratic residue mo...
This paper studies the distinctness of primitive sequences over Z/(M) modulo 2, where M is an odd in...
summary:In this article we study, using elementary and combinatorial methods, the distribution of qu...
summary:In this article we study, using elementary and combinatorial methods, the distribution of qu...
AbstractIn this paper it is shown that if p = 4k + 1 is a prime such that ϕ(p − 1)(p − 1) > 14, then...
summary:We examine primitive roots modulo the Fermat number $F_m=2^{2^m}+1$. We show that an odd int...
summary:We examine primitive roots modulo the Fermat number $F_m=2^{2^m}+1$. We show that an odd int...
AbstractWe address the problem of taking cube roots modulo an integer. We generalize two of the fast...
AbstractIn this paper it is shown that the number of pairs of consecutive primitive roots modulo p i...
Abstract For primes p, the multiplicative group of reduced residues modulo p is cyclic, with cyclic ...
Let $p$ be a prime. If an integer $g$ generates a subgroup of index $t$ in $(\mathbb Z/p\mathbb Z)^*...
The aim of this thesis is to lower the bound on square-free primitive roots modulo primes. Let g2(p)...
Includes bibliographical references.In this paper a study is first made of the congruence xⁿ ≡ b mod...
AbstractTwo conjectures about primitive roots are given. These conjectures are supported by empirica...
This note is devoted to studying quadratic nonresidues attached to certain binary representations of...
AbstractFor an odd prime p, let l(p) denote the least positive prime which is a quadratic residue mo...
This paper studies the distinctness of primitive sequences over Z/(M) modulo 2, where M is an odd in...