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 first purpose of our paper is to show how Hooley's celebrated method leading to his conditional ...
The problem on primitive roots modulo the powers of a prime ideal in a ring of algebraic integers is...
The problem on primitive roots modulo the powers of a prime ideal in a ring of algebraic integers is...
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...
AbstractLet a be an integer ≠−1 and not a square. Let Pa(x) be the number of primes up to x for whic...
AbstractWhile it has already been demonstrated that the set of twin primes (primes that differ by 2)...
AbstractTwo conjectures about primitive roots are given. These conjectures are supported by empirica...
summary:A positive integer $n$ is called a square-free number if it is not divisible by a perfect sq...
summary:A positive integer $n$ is called a square-free number if it is not divisible by a perfect sq...
Let $p$ be a prime. If an integer $g$ generates a subgroup of index $t$ in $(\mathbb Z/p\mathbb Z)^*...
A Lehmer number modulo a prime p is an integer a with 1 ≤ a ≤ p − 1 whose inverse a¯ within the sam...
AbstractA sequence A = {ai} of positive integers a1 < a2 < ⋯ is said to be primitive if no term of A...
AbstractLet p be an odd prime, ζ a primitive pth root of unity. It is proved that Π(1 + iζk)k, 1 ≤ k...
The first purpose of our paper is to show how Hooley's celebrated method leading to his conditional ...
The problem on primitive roots modulo the powers of a prime ideal in a ring of algebraic integers is...
The problem on primitive roots modulo the powers of a prime ideal in a ring of algebraic integers is...
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...
AbstractLet a be an integer ≠−1 and not a square. Let Pa(x) be the number of primes up to x for whic...
AbstractWhile it has already been demonstrated that the set of twin primes (primes that differ by 2)...
AbstractTwo conjectures about primitive roots are given. These conjectures are supported by empirica...
summary:A positive integer $n$ is called a square-free number if it is not divisible by a perfect sq...
summary:A positive integer $n$ is called a square-free number if it is not divisible by a perfect sq...
Let $p$ be a prime. If an integer $g$ generates a subgroup of index $t$ in $(\mathbb Z/p\mathbb Z)^*...
A Lehmer number modulo a prime p is an integer a with 1 ≤ a ≤ p − 1 whose inverse a¯ within the sam...
AbstractA sequence A = {ai} of positive integers a1 < a2 < ⋯ is said to be primitive if no term of A...
AbstractLet p be an odd prime, ζ a primitive pth root of unity. It is proved that Π(1 + iζk)k, 1 ≤ k...
The first purpose of our paper is to show how Hooley's celebrated method leading to his conditional ...
The problem on primitive roots modulo the powers of a prime ideal in a ring of algebraic integers is...
The problem on primitive roots modulo the powers of a prime ideal in a ring of algebraic integers is...
DOI
Add to ORKG