English
Related papers

Related papers: Bounded gaps between primes with a given primitive…

200 papers

Let $t \in \mathbb{N}$, $\eta >0$. Suppose that $x$ is a sufficiently large real number and $q$ is a natural number with $q \leq x^{5/12-\eta}$, $q$ not a multiple of the conductor of the exceptional character $\chi^*$ (if it exists).…

Number Theory · Mathematics 2016-01-27 Roger C. Baker , Liangyi Zhao

Let E be an elliptic curve over Q. In 1988, Koblitz conjectured a precise asymptotic for the number of primes p up to x such that the order of the group of points of E over the finite field F_p is prime. This is an analogue of the Hardy and…

Number Theory · Mathematics 2007-09-11 Antal Balog , Alina Cojocaru , Chantal David

A \emph{queue layout} of a graph consists of a \emph{linear order} of its vertices and a partition of its edges into \emph{queues}, so that no two independent edges of the same queue are nested. The \emph{queue number} of a graph is the…

Data Structures and Algorithms · Computer Science 2019-08-12 Michael A. Bekos , Henry Förster , Martin Gronemann , Tamara Mchedlidze , Fabrizio Montecchiani , Chrysanthi Raftopoulou , Torsten Ueckerdt

We prove a couple of related theorems including Legendre's and Andrica's conjecture. Key to the proofs is an algorithm that delivers the exact upper bound on the greatest gap that can occur in a combinatorial game with the set of P primes…

General Mathematics · Mathematics 2015-08-11 Jens Oehlschlägel

Analogously to primes in arithmetic progressions to large moduli, we can study primes that are totally split in extensions of $\mathbb{Q}$ of high degree. Motivated by a question of Kowalski we focus on the extensions $\mathbb{Q}(E[d])$…

Number Theory · Mathematics 2021-10-04 Jori Merikoski

Given an elliptic curve $E$ over a finite field $\F_q$ of $q$ elements, we say that an odd prime $\ell \nmid q$ is an Elkies prime for $E$ if $t_E^2 - 4q$ is a quadratic residue modulo $\ell$, where $t_E = q+1 - #E(\F_q)$ and $#E(\F_q)$ is…

Number Theory · Mathematics 2013-01-03 Igor Shparlinski

We generalise Zhang's and Pintz recent results on bounded prime gaps to give a lower bound for the the number of prime pairs bounded by 6*10^7 in the short interval $[x,x+x (\log x)^{-A}]$. Our result follows only by analysing Zhang's proof…

Number Theory · Mathematics 2013-06-07 Johan Andersson

For each prime $p$, let $I_p \subset \mathbb{Z}/p\mathbb{Z}$ denote a collection of residue classes modulo $p$ such that the cardinalities $|I_p|$ are bounded and about $1$ on average. We show that for sufficiently large $x$, the sifted set…

Number Theory · Mathematics 2023-11-01 Kevin Ford , Sergei Konyagin , James Maynard , Carl Pomerance , Terence Tao

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…

Number Theory · Mathematics 2007-05-23 Joseph Cohen

We prove that for positive integers $m \geq 1, n \geq 1$ and a prime number $p \neq 2,3$ there are finitely many finite $m$-generated Moufang loops of exponent $p^n$.

Rings and Algebras · Mathematics 2020-05-26 Alexander Grishkov , Liudmila Sabinina , Efim Zelmanov

Let $q$ be a prime power and $n, r$ integers such that $r\mid q^n-1$. An element of $\mathbb{F}_{q^n}$ of multiplicative order $(q^n-1)/r$ is called \emph{$r$-primitive}. For any odd prime power $q$, we show that there exists a…

Number Theory · Mathematics 2021-01-20 Stephen D. Cohen , Giorgos Kapetanakis

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…

Number Theory · Mathematics 2017-06-12 Dimitris Koukoulopoulos

Shiu proved that if a and q are arbitrary coprime integers, then there exist arbitrarily long strings of consecutive primes which are all congruent to a modulo q. We generalize Shiu's theorem to imaginary quadratic fields, where we prove…

Number Theory · Mathematics 2019-02-20 Frank Thorne

Given an integer $\gamma\geq 2$ and an odd prime power $q$ we show that for every large genus $g$ there exists a non-singular curve $C$ defined over $\mathbb{F}_q$ of genus $g$ and gonality $\gamma$ and with exactly $\gamma(q+1)$…

Number Theory · Mathematics 2022-03-18 Floris Vermeulen

We prove that for all $q>61$, every non-zero element in the finite field $\mathbb{F}_{q}$ can be written as a linear combination of two primitive roots of $\mathbb{F}_{q}$. This resolves a conjecture posed by Cohen and Mullen.

Number Theory · Mathematics 2014-03-19 Stephen D. Cohen , Tomás Oliveira e Silva , Tim Trudgian

The idea of generating prime numbers through sequence of sets of co-primes was the starting point of this paper that ends up by proving two conjectures, the existence of infinitely many twin primes and the Goldbach conjecture. The main idea…

General Mathematics · Mathematics 2016-09-19 Samir Brahim Belhaouari

Let $S$ be a string of $l$ decimal digits. We give an explicit upper bound on some prime $p$ whose decimal representation contains the string $S$. We also show, as a corollary of the Green-Tao theorem, that there are arbitrarily long…

Number Theory · Mathematics 2014-07-31 Adrian Dudek

Let $E$ be an elliptic curve over $\Bbb{Q}$ with the given Weierstrass equation $ y^2=x^3+ax+b$. If $D$ is a squarefree integer, then let $E^{(D)}$ denote the $D$-quadratic twist of $E$ that is given by $E^{(D)}: y^2=x^3+aD^2x+bD^3$. Let…

Number Theory · Mathematics 2015-01-20 Farzali Izadi , Kamran Nabardi

In this paper, we introduce and study a variant of Kummer's notion of (ir)regularity of primes which we call G-irregularity. It is based on Genocchi numbers $G_n$, rather than Bernoulli number $B_n.$ We say that an odd prime $p$ is…

Number Theory · Mathematics 2019-05-08 Su Hu , Min-Soo Kim , Pieter Moree , Min Sha

Under the assumption of Heath-Brown's conjecture on the first prime in an arithmetic progression, we prove that there are infinitely many Carmichael numbers $n$ such that the number of prime factors of $n$ is prime.

Number Theory · Mathematics 2024-03-19 Thomas Wright