Publication date
January 2002
DOI Publisher
Hindawi Limited ISSN
0161-1712 Journal
1687-0425Abstract
We study the set of differences {gx−gy(modp):1≤x, y≤N} where p is a large prime number, g is a primitive root (modp), and p2/3<N<p
We study the set of differences {gx−gy(modp):1≤x, y≤N} where p is a large prime number, g is a primitive root (modp), and p2/3<N<p
A Lehmer number modulo a prime p is an integer a with 1 ≤ a ≤ p − 1 whose inverse a¯ within the sam...
AbstractLet ζ be a primitive 2mth root of unity. We prove that Z[α]=Z[ζ] if and only if α=n±ζi for s...
Sieve methods have been developed as tools for establishing the existence of prime numbers, or else ...
AbstractIn general, not every set of values modulonwill be the set of roots modulonof some polynomia...
AbstractLet Ng={gn:1⩽n⩽N}, where g is a primitive root modulo an odd prime p, and let fg(m, H) denot...
The aim of this thesis is to lower the bound on square-free primitive roots modulo primes. Let g2(p)...
AbstractIn this paper it is shown that if p = 4k + 1 is a prime such that ϕ(p − 1)(p − 1) > 14, then...
International audienceE. Bach, following an idea of T. Itoh, has shown how to build a small set of n...
AbstractIn this paper it is shown that the number of pairs of consecutive primitive roots modulo p i...
Let p ≡ 1 (mod 4) be a prime. A residue difference set modulo p is a set S = {ai} of integers ai suc...
A subset B of a group G is called a difference basis of G if each element g ∈ G can be written as th...
Includes bibliographical references.In this paper a study is first made of the congruence xⁿ ≡ b mod...
Abstract For primes p, the multiplicative group of reduced residues modulo p is cyclic, with cyclic ...
Let p> 2 be a prime number. For each integer 0 < n < p, de¯ne n by the congruence nn ´ 1 (m...
For a prime p, we obtain an upper bound on the discrepancy of fractions r/p, where r runs through al...
A Lehmer number modulo a prime p is an integer a with 1 ≤ a ≤ p − 1 whose inverse a¯ within the sam...
AbstractLet ζ be a primitive 2mth root of unity. We prove that Z[α]=Z[ζ] if and only if α=n±ζi for s...
Sieve methods have been developed as tools for establishing the existence of prime numbers, or else ...
AbstractIn general, not every set of values modulonwill be the set of roots modulonof some polynomia...
AbstractLet Ng={gn:1⩽n⩽N}, where g is a primitive root modulo an odd prime p, and let fg(m, H) denot...
The aim of this thesis is to lower the bound on square-free primitive roots modulo primes. Let g2(p)...
AbstractIn this paper it is shown that if p = 4k + 1 is a prime such that ϕ(p − 1)(p − 1) > 14, then...
International audienceE. Bach, following an idea of T. Itoh, has shown how to build a small set of n...
AbstractIn this paper it is shown that the number of pairs of consecutive primitive roots modulo p i...
Let p ≡ 1 (mod 4) be a prime. A residue difference set modulo p is a set S = {ai} of integers ai suc...
A subset B of a group G is called a difference basis of G if each element g ∈ G can be written as th...
Includes bibliographical references.In this paper a study is first made of the congruence xⁿ ≡ b mod...
Abstract For primes p, the multiplicative group of reduced residues modulo p is cyclic, with cyclic ...
Let p> 2 be a prime number. For each integer 0 < n < p, de¯ne n by the congruence nn ´ 1 (m...
For a prime p, we obtain an upper bound on the discrepancy of fractions r/p, where r runs through al...
A Lehmer number modulo a prime p is an integer a with 1 ≤ a ≤ p − 1 whose inverse a¯ within the sam...
AbstractLet ζ be a primitive 2mth root of unity. We prove that Z[α]=Z[ζ] if and only if α=n±ζi for s...
Sieve methods have been developed as tools for establishing the existence of prime numbers, or else ...
Add to ORKG