DOIAbstract
AbstractTwo conjectures about primitive roots are given. These conjectures are supported by empirical evidence obtained by using a digital computer
AbstractTwo conjectures about primitive roots are given. These conjectures are supported by empirical evidence obtained by using a digital computer
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart...
Abstract For primes p, the multiplicative group of reduced residues modulo p is cyclic, with cyclic ...
Let $x \geq 1$ be a large number, let $f(n) \in \mathbb{Z}[x]$ be a prime producing polynomial of de...
AbstractTwo conjectures about primitive roots are given. These conjectures are supported by empirica...
International audienceE. Bach, following an idea of T. Itoh, has shown how to build a small set of n...
AbstractWe show that in any finite field Fq a primitive root can be found in time O(q14 + ε)
Digital roots of numbers have several interesting properties, most of which are well-known. In this ...
Three theorems are given for approximate determination of magnitudes of polynomial roots. A definiti...
The main purpose of this paper is to study the arithmetical properties of the primitive numbers of p...
AbstractThe primitive elements of a finite field are those elements of the field that generate the m...
Two additional new theorems are posed and proven to estimate the magnitudes of roots of polynomials....
Sieve methods have been developed as tools for establishing the existence of prime numbers, or else ...
Throughout this paper, small case Latin letters, with the exception of i which has its usual mathema...
A research report submitted to the Faculty of Science, in partial fulfilment of the requirements for...
We study the set of differences {gx−gy(modp):1≤x, y≤N} where p is a large prime number, g is a pri...
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart...
Abstract For primes p, the multiplicative group of reduced residues modulo p is cyclic, with cyclic ...
Let $x \geq 1$ be a large number, let $f(n) \in \mathbb{Z}[x]$ be a prime producing polynomial of de...
AbstractTwo conjectures about primitive roots are given. These conjectures are supported by empirica...
International audienceE. Bach, following an idea of T. Itoh, has shown how to build a small set of n...
AbstractWe show that in any finite field Fq a primitive root can be found in time O(q14 + ε)
Digital roots of numbers have several interesting properties, most of which are well-known. In this ...
Three theorems are given for approximate determination of magnitudes of polynomial roots. A definiti...
The main purpose of this paper is to study the arithmetical properties of the primitive numbers of p...
AbstractThe primitive elements of a finite field are those elements of the field that generate the m...
Two additional new theorems are posed and proven to estimate the magnitudes of roots of polynomials....
Sieve methods have been developed as tools for establishing the existence of prime numbers, or else ...
Throughout this paper, small case Latin letters, with the exception of i which has its usual mathema...
A research report submitted to the Faculty of Science, in partial fulfilment of the requirements for...
We study the set of differences {gx−gy(modp):1≤x, y≤N} where p is a large prime number, g is a pri...
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart...
Abstract For primes p, the multiplicative group of reduced residues modulo p is cyclic, with cyclic ...
Let $x \geq 1$ be a large number, let $f(n) \in \mathbb{Z}[x]$ be a prime producing polynomial of de...
Add to ORKG