AbstractIn this paper it is shown that the number of pairs of consecutive primitive roots modulo p is asymptotic to (p − 2)(ϕ(p − 1)(p − 1))2, and that, for all sufficiently large primes p, there is at least one pair of consecutive primitive roots modulo p. The theorem proved here is a generalization of this proposition. Another one is mentioned in the remarks
The aim of this thesis is to lower the bound on square-free primitive roots modulo primes. Let g2(p)...
AbstractLet g∈Q\{−1, 0, 1}. Let p be a prime. Let ordp(g) denote the exponent of p in the canonical ...
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart...
AbstractIn this paper it is shown that if p = 4k + 1 is a prime such that ϕ(p − 1)(p − 1) > 14, then...
AbstractIn this paper it is shown that the number of pairs of consecutive primitive roots modulo p i...
AbstractIn this paper it is shown that if p = 4k + 1 is a prime such that ϕ(p − 1)(p − 1) > 14, then...
Abstract. We improve estimates for the distribution of primitive λ-roots of a composite modulus q yi...
summary:A positive integer $n$ is called a square-free number if it is not divisible by a perfect sq...
Given finitely many non zero rational numbers which are not $pm1$, we prove, under the assumption o...
AbstractLet a be an integer ≠−1 and not a square. Let Pa(x) be the number of primes up to x for whic...
Given finitely many non zero rational numbers which are not $\pm1$, we prove, under the assumption ...
AbstractLet Ng={gn:1⩽n⩽N}, where g is a primitive root modulo an odd prime p, and let fg(m, H) denot...
AbstractWhile it has already been demonstrated that the set of twin primes (primes that differ by 2)...
Sieve methods have been developed as tools for establishing the existence of prime numbers, or else ...
AbstractLet p be a prime, u be a linear recurring sequence of integers of order d and let S=3d2+9d2+...
The aim of this thesis is to lower the bound on square-free primitive roots modulo primes. Let g2(p)...
AbstractLet g∈Q\{−1, 0, 1}. Let p be a prime. Let ordp(g) denote the exponent of p in the canonical ...
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart...
AbstractIn this paper it is shown that if p = 4k + 1 is a prime such that ϕ(p − 1)(p − 1) > 14, then...
AbstractIn this paper it is shown that the number of pairs of consecutive primitive roots modulo p i...
AbstractIn this paper it is shown that if p = 4k + 1 is a prime such that ϕ(p − 1)(p − 1) > 14, then...
Abstract. We improve estimates for the distribution of primitive λ-roots of a composite modulus q yi...
summary:A positive integer $n$ is called a square-free number if it is not divisible by a perfect sq...
Given finitely many non zero rational numbers which are not $pm1$, we prove, under the assumption o...
AbstractLet a be an integer ≠−1 and not a square. Let Pa(x) be the number of primes up to x for whic...
Given finitely many non zero rational numbers which are not $\pm1$, we prove, under the assumption ...
AbstractLet Ng={gn:1⩽n⩽N}, where g is a primitive root modulo an odd prime p, and let fg(m, H) denot...
AbstractWhile it has already been demonstrated that the set of twin primes (primes that differ by 2)...
Sieve methods have been developed as tools for establishing the existence of prime numbers, or else ...
AbstractLet p be a prime, u be a linear recurring sequence of integers of order d and let S=3d2+9d2+...
The aim of this thesis is to lower the bound on square-free primitive roots modulo primes. Let g2(p)...
AbstractLet g∈Q\{−1, 0, 1}. Let p be a prime. Let ordp(g) denote the exponent of p in the canonical ...
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart...
DOI.png%3Fwidth%3D300&w=3840&q=75)
Add to ORKG