Related papers: Semi-primitive roots and irreducible quadratic for…

We describe a straightforward method to generate a random prime q such that the multiplicative group GF(q)* also has a random large prime-order subgroup. The described algorithm also yields this order p as well as a p'th primitive root of…

Let $q=p^k$ be a prime power, let $n\geq2$ be an integer and let $\mathbb{F}_{q^n}$ be a finite field. It is shown that the set of primitive normal elements is a Salem set. Furthermore, it is proved that this set is strongly equidistributed…

We present a novel idea to compute square roots over finite fields, without being given any quadratic nonresidue, and without assuming any unproven hypothesis. The algorithm is deterministic and the proof is elementary. In some cases, the…

A primitive root modulo an integer $n$ is the generator of the multiplicative group of integers modulo $n$. Gauss proved that for any prime number $p$ greater than $3$, the sum of its primitive roots is congruent to $1$ modulo $p$ while its…

We obtain a simple relations for the Newman sum over multiples of a prime with a primitive or semiprimitive root 2. We consider the case of p=17 as well.

Let $q\geq 1$ be any integer and let $ \epsilon \in [\frac{1}{11}, \frac{1}{2})$ be a given real number. In this short note, we prove that for all primes $p$ satisfying $$ p\equiv 1\pmod{q}, \quad \log\log p > \frac{\log…

Multiplicative order of an element $a$ of group $G$ is the least positive integer $n$ such that $a^n=e$, where $e$ is the identity element of $G$. If the order of an element is equal to $|G|$, it is called generator or primitive root. This…

An integer is a primitive root modulo a prime $p$ if it generates the whole multiplicative group $(\mathbb{Z}/p\mathbb{Z})^*$. In 1927 Artin conjectured that an integer $a$ which is not $-1$ or a square is a primitive root for infintely…

Let $q\ne \pm1,v^2$ be a fixed integer, and let $x\geq 1$ be a large number. The least prime number $p \geq3 $ such that $q$ is a primitive root modulo $p$ is conjectured to be $p\ll (\log q)(\log \log q)^3),$ where $\gcd(p,q)=1$. This note…

This note determines an effective asymptotic formula for the number of squarefree totients $p-1$ with a fixed primitive root $u\ne \pm 1, v^2$.

We consider an analogue of Artin's primitive root conjecture for units in real quadratic fields. Given such a nontrivial unit, for a rational prime p which is inert in the field the maximal order of the unit modulo p is p+1. An extension of…

Primitive polynomials over finite fields are crucial for various domains of computer science, including classical pseudo-random number generation, coding theory and post-quantum cryptography. Nevertheless, the pursuit of an efficient…

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

Artin's Conjecture on Primitive Roots states that a non-square nonunit integer $a$ is a primitive root modulo $p$ for the positive proportion of $p$. This conjecture remains open, but on average, there are many results due to P. J.…

Let $\mathcal{A}'$ be the set of integers missing any three fixed digits from their decimal expansion. We produce primes in a thin sequence by proving an asymptotic formula for counting primes of the form $p = m^2 + \ell^2$, with $\ell \in…

Following the Perron-Frobenius theorem, the spectral radius of a primitive matrix is a simple eigenvalue. It is shown that for a primitive matrix $A$, there is a positive rank one matrix $X$ such that $B = A \circ X$, where $\circ$ denotes…

This paper, a continuation of [3], involves a closer study of polynomials of supertropical semirings and their version of tropical geometry in which we introduce the concept of relatively prime polynomials and resultants, with the aid of…

Let $G$ be a finite group and $p$ be a prime. We study the kernel of the map, between the Burnside ring of $G$ and the Grothendieck ring of $\mathbb{F}_p[G]$-modules, taking a $G$-set to its associated permutation module. We are able, for…

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

A quasi-Toeplitz $M$-matrix $A$ is an infinite $M$-matrix that can be written as the sum of a semi-infinite Toeplitz matrix and a correction matrix. This paper is concerned with computing the square root of invertible quasi-Toeplitz…