Add to ORKGAbstract. We improve estimates for the distribution of primitive λ-roots of a composite modulus q yielding an asymptotic formula for the number of primitive λ-roots in any interval I of length |I | q 12+. Similar results are obtained for the distribution of ordered pairs (x, x−1) with x a primitive λ-root, and for the number of primitive λ-roots satisfying inequalities such as |x − x−1 | ≤ B. 1
Let g be a primitive root modulo a prime p. It is proved that the triples (gx, gy, gxy), x, yfl 1, …...
AbstractThe asymptotic distribution of the roots of the congruence ax ≡ b (mod D), 1 ≤ x ≤ D, as D v...
Let g be a primitive root modulo a prime p. It is proved that the triples (gx, gy, gxy), x, yfl 1, …...
AbstractIn this paper it is shown that the number of pairs of consecutive primitive roots modulo p i...
AbstractLet a be an integer ≠−1 and not a square. Let Pa(x) be the number of primes up to x for whic...
Let q be a natural number. When the multiplicative group (Z/qZ) ∗ is a cyclic group, its generators ...
AbstractIn this paper it is shown that if p = 4k + 1 is a prime such that ϕ(p − 1)(p − 1) > 14, then...
summary:A positive integer $n$ is called a square-free number if it is not divisible by a perfect sq...
Sieve methods have been developed as tools for establishing the existence of prime numbers, or else ...
AbstractLet Ng={gn:1⩽n⩽N}, where g is a primitive root modulo an odd prime p, and let fg(m, H) denot...
For a prime p, we obtain an upper bound on the discrepancy of fractions r/p, where r runs through al...
Throughout this paper, small case Latin letters, with the exception of i which has its usual mathema...
AbstractWe investigate the distribution of the numbers x∈[1,p] for which a1x+b1,…,asx+bs(modp) all l...
AbstractIn this paper we study the distribution modulo 1 of the sequence of vectors (pα1, …, pαk), w...
AbstractIf p is a prime, a is a primitive root modulo p, and n is a positive integer, let ri(n) be t...
Let g be a primitive root modulo a prime p. It is proved that the triples (gx, gy, gxy), x, yfl 1, …...
AbstractThe asymptotic distribution of the roots of the congruence ax ≡ b (mod D), 1 ≤ x ≤ D, as D v...
Let g be a primitive root modulo a prime p. It is proved that the triples (gx, gy, gxy), x, yfl 1, …...
AbstractIn this paper it is shown that the number of pairs of consecutive primitive roots modulo p i...
AbstractLet a be an integer ≠−1 and not a square. Let Pa(x) be the number of primes up to x for whic...
Let q be a natural number. When the multiplicative group (Z/qZ) ∗ is a cyclic group, its generators ...
AbstractIn this paper it is shown that if p = 4k + 1 is a prime such that ϕ(p − 1)(p − 1) > 14, then...
summary:A positive integer $n$ is called a square-free number if it is not divisible by a perfect sq...
Sieve methods have been developed as tools for establishing the existence of prime numbers, or else ...
AbstractLet Ng={gn:1⩽n⩽N}, where g is a primitive root modulo an odd prime p, and let fg(m, H) denot...
For a prime p, we obtain an upper bound on the discrepancy of fractions r/p, where r runs through al...
Throughout this paper, small case Latin letters, with the exception of i which has its usual mathema...
AbstractWe investigate the distribution of the numbers x∈[1,p] for which a1x+b1,…,asx+bs(modp) all l...
AbstractIn this paper we study the distribution modulo 1 of the sequence of vectors (pα1, …, pαk), w...
AbstractIf p is a prime, a is a primitive root modulo p, and n is a positive integer, let ri(n) be t...
Let g be a primitive root modulo a prime p. It is proved that the triples (gx, gy, gxy), x, yfl 1, …...
AbstractThe asymptotic distribution of the roots of the congruence ax ≡ b (mod D), 1 ≤ x ≤ D, as D v...
Let g be a primitive root modulo a prime p. It is proved that the triples (gx, gy, gxy), x, yfl 1, …...