English
Related papers

Related papers: Primitive root bias for twin primes

200 papers

We consider the exceptional set in the binary Goldbach problem for sums of two almost twin primes. Our main result is a power-saving bound for the exceptional set in the problem of representing $m=p_1+p_2$ where $p_1+2$ has at most $2$…

Number Theory · Mathematics 2022-07-20 Lasse Grimmelt , Joni Teräväinen

We use the Bateman--Horn Conjecture from number theory to give strong evidence of a positive answer to Peter Neumann's question, whether there are infinitely many simple groups of order a product of six primes. (Those with fewer than six…

Group Theory · Mathematics 2022-09-15 Gareth A. Jones , Alexander K. Zvonkin

This paper is continuation of the paper "Primitive roots in quadratic field". We consider an analogue of Artin's primitive root conjecture for algebraic numbers which is not a unit in real quadratic fields. Given such an algebraic number,…

Number Theory · Mathematics 2007-05-23 Joseph Cohen

We say that a prime number $p$ is an $\textit{Artin prime}$ for $g$ if $g$ mod $p$ generates the group $(\mathbb{Z}/p\mathbb{Z})^{\times}$. For appropriately chosen integers $d$ and $g$, we present a conjecture for the asymptotic number…

Number Theory · Mathematics 2023-01-16 Magdaléna Tinková , Ezra Waxman , Mikuláš Zindulka

Let $p\geq 2$ be a large prime, and let $N\gg ( \log p)^{1+\varepsilon}$. This note proves the existence of primitive roots in the short interval $[M,M+N]$, where $M \geq 2$ is a fixed number, and $ \varepsilon>0$ is a small number. In…

General Mathematics · Mathematics 2020-05-27 N. A. Carella

We present a prime-generating polynomial $(1+2n)(p -2n) + 2$ where $p>2$ is a lower member of a pair of twin primes less than $41$ and the integer $n$ is such that $\: \frac {1-p}{2} < n < p-1$.

General Mathematics · Mathematics 2017-02-23 Madieyna Diouf

Given $F= \mathbb{F}_{p^{t}}$, a field with $p^t$ elements, where $p $ is a prime power, $t\geq 7$, $n$ are positive integers and $f=f_1/f_2$ is a rational function, where $f_1, f_2$ are relatively prime, irreducible polynomials with…

Number Theory · Mathematics 2023-01-09 Aakash Choudhary , R. K. Sharma

This document seeks to prove there are infinitely many primes whose difference is 2, referred to as twin prime pairs. This proof's methodology involves constructing a function that approximates the number of positive integers, less than a…

General Mathematics · Mathematics 2017-11-01 Kevin B. Espinet

This note investigates the average density of prime numbers $p\in[x,2x]$ with respect to a random simultaneous primitive root $g\leq p^{1/2+\varepsilon}$ over the finite rings $\mathbb{Z}/p\mathbb{Z}$ and $\mathbb{Z}/p^2\mathbb{Z}$ as $x…

General Mathematics · Mathematics 2025-01-22 N. A. Carella

This work proposes elementary proofs of several related primes counting problems, based on an elementary weighted sieve. The subsets of primes considered here are the followings: the subset of twin primes PT = {p and p + 2 are primes}, the…

General Mathematics · Mathematics 2012-08-29 N. A. Carella

We examine linear sums of primitive roots and their inverses in finite fields. In particular, we refine a result by Li and Han, and show that every $p> 13$ has a pair of primitive roots $a$ and $b$ such that $a+ b$ and $a^{-1} + b^{-1}$ are…

Number Theory · Mathematics 2018-12-11 Stephen Cohen , Tomás Oliveira e Silva , Nicole Sutherland , Tim Trudgian

We use character sum estimates to give a bound on the least square-full primitive root modulo a prime. Specifically, we show that there is a square-full primitive root mod $p$ less than $p^{2/3 + 3/(4 \sqrt{e})+ \epsilon}$, and we give some…

Number Theory · Mathematics 2017-03-16 Marc Munsch , Tim Trudgian

We obtain formulae for the numbers of isomorphism and conjugacy classes of non-identity proper subgroups of the groups $G={\rm PSL}_2(p)$, $p$ prime, and for the numbers of those conjugacy classes which do or do not consist of…

Group Theory · Mathematics 2024-11-05 Gareth A. Jones

Fix $a \in \mathbb{Z}$, $a\notin \{0,\pm 1\}$. A simple argument shows that for each $\epsilon > 0$, and almost all (asymptotically 100% of) primes $p$, the multiplicative order of $a$ modulo $p$ exceeds $p^{\frac12-\epsilon}$. It is an…

Number Theory · Mathematics 2020-06-30 Komal Agrawal , Paul Pollack

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.…

Number Theory · Mathematics 2022-02-28 Sungjin Kim

We adopt an empirical approach to the characterization of the distribution of twin primes within the set of primes, rather than in the set of all natural numbers. The occurrences of twin primes in any finite sequence of primes are like…

Number Theory · Mathematics 2007-05-23 P. F. Kelly , Terry Pilling

This monograph considers a few topics in the theory of primitive roots g(p) modulo a prime p>=2. A few estimates of the least primitive roots g(p) and the least prime primitive roots g^*(p) modulo p, a large prime, are determined. One of…

General Mathematics · Mathematics 2015-03-13 N. A. Carella

Primitive roots of 1 mod p^k (k>2 and odd prime p) are sought, in cyclic units group G_k = A_k B_k mod p^k, coprime to p, of order (p-1)p^{k-1}. 'Core' subgroup A_k has order p-1 independent of k, and p+1 generates 'extension' subgroup B_k…

General Mathematics · Mathematics 2007-05-23 N. F. Benschop

Given an integer $t\ge 1$, a rational number $g$ and a prime $p\equiv 1({\rm mod} t)$ we say that $g$ is a near-primitive root of index $t$ if $\nu_p(g)=0$, and $g$ is of order $(p-1)/t$ modulo $p$. In the case $g$ is not minus a square we…

Number Theory · Mathematics 2020-08-27 Pieter Moree

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

Number Theory · Mathematics 2007-08-09 William D. Banks , Igor E. Shparlinski