Related papers: Note on Artin's Conjecture on Primitive Roots

Let $p>2$ be prime and $g$ a primitive root modulo $p$. We present an argument for the fact that discrete logarithms of the numbers in any arithmetic progression are uniformly distributed in $[1,p]$ and raise some questions on the subject.

Let $<\P > \subset \N$ be a multiplicative subsemigroup of the natural numbers $\N = \{1,2,3,...\}$ generated by an arbitrary set $\P$ of primes (finite or infinite). We given an elementary proof that the partial sums $\sum_{n \in < \P >: n…

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…

We show that the existence of a non-trivial solution of $x^n+y^n=p^n$, with $p$ a prime number, is equivalent to the existence of a solution of a certain (over-determined) system of $(n-1)$-recursion relations ("zipper" equations) in…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and, for a prime $p$ of good reduction for $E$ let $\tilde{E}_p$ denote the reduction of $E$ modulo $p$. Inspired by an elliptic curve analogue of Artin's primitive root conjecture…

In 1876, Edouard Lucas showed that if an integer $b$ exists such that $b^{n-1} \equiv 1 (\mathrm{mod} \ n)$ and $b^{(n-1)/p} \not\equiv 1( \mathrm{mod} \ n)$ for all prime divisors $p$ of $n-1$ , then $n$ is prime, a result known as Lucas's…

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…

We extend some methods of bounding exponential sums of the type $\displaystyle\sum_{n\le N}e^{2\pi iag^n/p}$ to deal with the case when $g$ is not necessarily a primitive root. We also show some recent results of Shkredov concerning…

Let $p$ be an odd prime, and let $\sum_{n=0}^{\infty} a_{n}X^{n}\in\mathbb{F}_p[[X]]$ be the reduction modulo $p$ of the Artin-Hasse exponential. We obtain a polynomial expression for $a_{kp}$ in terms of those $a_{rp}$ with $r<k$, for even…

We discuss how one could study asymptotics of cyclotomic quantities via the mean values of certain multiplicative functions and their Dirichlet series using a theorem of Delange. We show how this could provide a new approach to Artin's…

We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions which are close to their mean value. This enables us to obtain various new results as well as strengthen existing results with new proofs.…

Let $p$ be a prime number. A longstanding conjecture asserts that every finite non-abelian $p$-group has a non-inner automorphism of order $p$. In this paper, we prove that if $G$ is an odd order finite non-abelian monolithic $p$-group such…

Numerical evidence suggests that for only about $2\%$ of pairs $p,p+2$ of twin primes, $p+2$ has more primitive roots than does $p$. If this occurs, we say that $p$ is exceptional (there are only two exceptional pairs with $5 \leq p \leq…

For an odd prime $p$, we say $f(X) \in {\mathbb F}_p[X]$ computes square roots in $\mathbb F_p$ if, for all nonzero perfect squares $a \in \mathbb F_p$, we have $f(a)^2 = a$. When $p \equiv 3 \mod 4$, it is well known that $f(X) =…

Write $T(n)$ as the sum of the reciprocals of the primes which divide $n$. Write $H(n) = \prod_{p|n}p/(p-1)$ where the product is over the prime divisors of $n$. We prove new bounds for $T(n)$ and $H(n)$ in terms of the smallest prime…

Suppose that $p$ is an odd prime and $g>1$ is a primitive root modulo $p$. Let $M$ be a number field contained in the $p$-th cyclotomic field. Girstmair found a surprising relation between the relative class number of $M$ and the digits of…

Let K be a number field, let f(x) in K(x) be a rational function of degree d> 1, and let z in K be a wandering point such that f^n(z) is nonzero for all n > 0. We prove that if the abc-conjecture holds for K, then for all but finitely many…

A set of positive integers is primitive (or 1-primitive) if no member divides another. Erd\H{o}s proved in 1935 that the weighted sum $\sum1/(n \log n)$ for $n$ ranging over a primitive set $A$ is universally bounded over all choices for…

Let $F$ be a totally real number field, $p$ a rational prime, and $\chi$ a finite order totally odd abelian character of Gal$(\bar{F}/F)$ such that $\chi(\mathfrak{p})=1$ for some $\mathfrak{p}|p$. Motivated by a conjecture of Stark, Gross…

Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab+cd of two ordered products ab and cd such that min(a, b) > max(c, d). An easy corollary is a proof of Fermat's Theorem expressing primes in 1 + 4N as sums of two…