Related papers: The Least Square-free Primitive Root Modulo a Prim…

An exponent of distribution 1/16 is established for square-free palindromes. The main input is an upper bound for the number of palindromes, in arithmetic progressions to large moduli, divisible by large squares. Our argument combines a…

We prove that if p is a prime with a primitive root 2 then S_p(2^p)=p and give a sufficient condition for an equality of kind S_p(2^p)=+or-p.

We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of…

We show that for each prime p > 7, every residue mod p can be represented by a squarefree number with largest prime factor at most p. We give two applications to recursive prime generators akin to the one Euclid used to prove the infinitude…

A set of natural numbers is primitive if no element of the set divides another. Erd\H{o}s conjectured that if S is any primitive set, then \sum_{n\in S} 1/(n log n) \le \sum_{n\in \P} 1/(p log p), where \P denotes the set of primes. In this…

For each prime $p$, let $n(p)$ denote the least quadratic nonresidue modulo $p$. Vinogradov conjectured that $n(p) = O(p^\eps)$ for every fixed $\eps>0$. This conjecture follows from the generalised Riemann hypothesis, and is known to hold…

We study the equidistribution of multiplicatively defined sets, such as the squarefree integers, quadratic non-residues or primitive roots, in sets which are described in an additive way, such as sumsets or Hilbert cubes. In particular, we…

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…

Let $E/\mathbb{Q}$ be an elliptic curve. For a prime $p$ of good reduction, let $r(E,p)$ be the smallest non-negative integer that gives the $x$-coordinate of a point of maximal order in the group $E(\mathbb{F}_p)$. We prove unconditionally…

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…

Let $n$ be an arbitrary integer, let $p$ be a prime factor of $n$. Denote by $\omega_1$ the $p^{th}$ primitive unity root, $\omega_1:=e^{\frac{2\pi i}{p}}$. Define $\omega_i:=\omega_1^i$ for $0\leq i\leq p-1$ and…

E. Artin conjectured that any integer $a >1$ which is not a perfect square is a primitive root modulo $p$ for infinitely many primes $p.$ Let $f_a(p)$ be the multiplicative order of the non-square integer $a$ modulo the prime $p.$ M. R.…

For a prime $p$, let $c(p)$ denote the limiting fraction of $n\times n$ matrices over $\mathbb{F}_p$ whose determinant is a primitive root modulo $p$. The quantity $c(p)$ is a natural multiplicative deformation of the totient ratio…

Let $r \ge 2$ be an integer and let $A$ be a finite, nonempty set of nonzero integers. We will obtain a lower bound for the number of squarefree integers $n$, up to $x$, for which the products $\prod_{p \mid n} (p+a)$ (over primes $p$) are…

Let $z\ne \pm1,w^2$ be a fixed integer, and let $f(t)\ne g(t)^2$ be a fixed polynomial over the integers. It is shown that the subset of primes $p\geq 2$ such that $z$ and $f(z)$ is a pair of simultaneous primitive roots modulo $p$ has…

Let g be a non-zero rational number. Let N_{g,t}(x) denote the number of primes p<=x for which the subgroup of the multiplicative group of the finite field having p elements that is generated by g mod p is of residual index t. In Part I,…

Let $p$ be an odd prime, and define $$G_p(x)=\prod_{k=1}^{(p-1)/2}\left(x-e^{2\pi i k^2/p}\right).$$ In this paper we study values of $G_p(x)$ at roots of unity via Galois theory, and confirm some previous conjectures. For example, for any…

We study the difference between the number of primitive roots modulo $p$ and modulo $p+k$ for prime pairs $p,p+k$. Assuming the Bateman-Horn conjecture, we prove the existence of strong sign biases for such pairs. More importantly, we prove…

E. Bach, following an idea of T. Itoh, has shown how to build a small set of numbers modulo a prime p such that at least one element of this set is a generator of $\pF{p}$\cite{Bach:1997:sppr,Itoh:2001:PPR}. E. Bach suggests also that at…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and without complex multiplication. For a prime $p$ of good reduction for $E$, we write $\#E_p(\mathbb{F}_p) = p + 1 - a_p(E)$ for the number of $\mathbb{F}_p$-rational points of the…