Related papers: Counting primes with a given primitive root, unifo…

Assuming that the Generalized Riemann Hypothesis (GRH) holds, we prove an explicit formula for the number of representations of an integer as a sum of $k\geq 5$ primes. Our error terms in such a formula improve by some logarithmic factors…

The Cram\'er-Granville conjecture is an upper bound on prime gaps, $g_n = p_{n+1} - p_n < \cCramer \, \log^2 p_n$ for some constant $\cCramer \geq 1$. Using a formula of Selberg, we first prove the weaker summed version: $\sum_{n=1}^N g_n <…

Let $G$ be a permutation group on a set $\Omega$. A subset of $\Omega$ is a base for $G$ if its pointwise stabilizer in $G$ is trivial. By $b(G)$ we denote the size of the smallest base of $G$. Every permutation group with $b(G)=2$ contains…

A set is primitive if no element of the set divides another. We consider primitive sets of monic polynomials over a finite field and find natural generalizations of many of the results known for primitive sets of integers. In particular we…

For any positive integer r, let pi_{2r}(x) denote the number of prime pairs (p, p+2r) with p not exceeding (large) x. According to the prime-pair conjecture of Hardy and Littlewood, pi_{2r}(x) should be asymptotic to 2C_{2r}li_2(x) with an…

For a prime $p\equiv 1 \,(\bmod{4})$, let \[ \varepsilon = \frac{1}{2}\left( t + u\sqrt{p}\right) \] be the fundamental unit of the real quadratic field $\mathbb{Q}(\sqrt{p})$. In 1951, N. Ankeny, E. Artin, and S. Chowla asked whether $p$…

An almost PI algebra is a generalisation of a just infinite algebra which does not satisfy a polynomial identity. An almost PI algebra has some nice properties: It is prime, has a countable cofinal subset of ideals and when satisfying…

This note generalizes the Fibonacci primitive roots to the set of integers. An asymptotic formula for counting the number of integers with such primitive root is introduced here.

Using a sieve-theoretic argument, we show that almost all gaps $(p_n, p_{n+1})$ between consecutive primes $p_n, p_{n+1}$ contain a natural number $m$ whose least prime factor $p(m)$ is at least the length $p_{n+1} - p_n$ of the gap,…

All the known approximations of the number of primes pi(n) not exceeding any given integer n are derived from real-valued functions that are asymptotic to pi(x), such as x/log x, Li(x) and Riemann's function R(x). The degree of…

In 1947 Mills proved that there exists a constant $A$ such that $\lfloor A^{3^n} \rfloor$ is a prime for every positive integer $n$. Determining $A$ requires determining an effective Hoheisel type result on the primes in short intervals -…

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…

The theory of elliptic pairs, as investigated in a paper by Castravet, Laface, Tevelev, and Ugaglia, provides useful conditions to determine polyhedrality of the pseudo-effective cone, which give rise to interesting arithmetic questions…

Let $p>1$ be a large prime number and let $x=O((\log p)^2(\log\log p)^5$ be a real number. It is proved that the least consecutive pair of primitive roots $u\ne\pm1, v^2$ and $u+1$ satisfies the upper bound $u\ll x$ in the prime field…

Let $Q(n)$ denote the number of integers $1 \leq q \leq n$ whose prime factorization $q= \prod^{t}_{i=1}p^{a_i}_i$ satisfies $a_1\geq a_2\geq \ldots \geq a_t$. Hardy and Ramanujan proved that $$ \log Q(n) \sim \frac{2\pi}{\sqrt{3}}…

We present several constraints on the absolute Galois groups G_F of fields F containing a primitive pth root of unity, using restrictions on the cohomology of index p normal subgroups from a previous paper by three of the authors. We first…

Let $G$ be a permutation group on a finite set $\Omega$. A subset $B \subseteq \Omega$ is a base for $G$ if the pointwise stabilizer of $B$ in $G$ is trivial. The base size of $G$, denoted $b(G)$, is the smallest size of a base. A well…

Let $\mathbb{F}_p$ be a finite field of size $p$ where $p$ is an odd prime. Let $f(x)\in\mathbb{F}_p[x]$ be a polynomial of positive degree $k$ that is not a $d$-th power in $\mathbb{F}_p[x]$ for all $d\mid p-1$. Furthermore, we require…

D.H. Lehmer found a quadratic polynomial such that 326 is a primitive root for the first 206 primes represented by this polynomial. It is shown that this is related to the class number one problem and prime producing quadratics. An…

A well-known conjecture of Gilbreath, and independently Proth from the 1800s, states that if $a_{0,n} = p_n$ denotes the $n^{\text{th}}$ prime number and $a_{i,n} = |a_{i-1,n}-a_{i-1,n+1}|$ for $i, n \ge 1$, then $a_{i,1} = 1$ for all $i…