English
Related papers

Related papers: Refinements for primes in short arithmetic progres…

200 papers

Assuming the Riemann Hypothesis, we prove that for all $x\geq 2$, there exists at least one even integer within the interval $(x, x+123\log^2x]$, that can be expressed as the sum of two primes. This result is an improvement over the recent…

Number Theory · Mathematics 2025-12-30 Andrés Chirre , Markus Valås Hagen

It is known that first-order logic with some counting extensions can be efficiently evaluated on graph classes with bounded expansion, where depth-$r$ minors have constant density. More precisely, the formulas are $\exists x_1 ... x_k \#y…

Logic in Computer Science · Computer Science 2023-07-06 Jan Dreier , Daniel Mock , Peter Rossmanith

We study the approximation error $\varepsilon(x)=\operatorname{li}_{*}(x)-\operatorname{li}(x)$ arising from the classical Stieltjes asymptotic expansion for the logarithmic integral. Our analysis is based on the discrete values…

Number Theory · Mathematics 2026-01-01 Jonatan Gomez

A classical problem in number theory is showing that the mean value of an arithmetic function is asymptotic to its mean value over a short interval or over an arithmetic progression, with the interval as short as possible or the modulus as…

Number Theory · Mathematics 2022-04-25 Ofir Gorodetsky

We prove that a positive proportion of the intervals of any fixed scalar multiple of $\log(X)$ in the dyadic interval $[X,2X]$ contain a prime number. We also show that a positive proportion of the congruence classes modulo $q$ contain a…

Number Theory · Mathematics 2018-02-26 Naser T. Sardari

A well-known conjecture asserts that, for any given positive real number $\lambda$ and nonnegative integer $m$, the proportion of positive integers $n \le x$ for which the interval $(n,n + \lambda\log n]$ contains exactly $m$ primes is…

Number Theory · Mathematics 2015-08-04 Tristan Freiberg

We prove that there is a small but fixed positive integer e such that for every prime larger than a fixed integer, every subset S of the integers modulo p which satisfies |2S|<(2+e)|S| and 2(|2S|)-2|S|+2 < p is contained in an arithmetic…

Number Theory · Mathematics 2009-10-03 Oriol Serra , Gilles Zémor

We furnish an explicit bound for the prime number theorem in short intervals on the assumption of the Riemann hypothesis.

Number Theory · Mathematics 2022-04-18 Michaela Cully-Hugill , Adrian W. Dudek

The Generalized Riemann Hypothesis implies that at least 50% of the central values $L \left( \frac{1}{2},\chi\right)$ are non-vanishing as $\chi$ ranges over primitive characters modulo $q$. We show that one may unconditionally go beyond…

Number Theory · Mathematics 2024-09-18 Kyle Pratt

$L$ functions based on Dirichlet characters are natural generalizations of the Riemann $\zeta(s)$ function: they both have series representations and satisfy an Euler product representation, i.e. an infinite product taken over prime…

Number Theory · Mathematics 2019-06-28 André LeClair , Giuseppe Mussardo

We provide very effective methods to convert both asymptotic and explicit numeric bounds on the prime counting function $\psi(x)$ to bounds of the same type on both $\theta(x)$ and $\pi(x)$. This follows up our previous work on $\psi(x)$ in…

Number Theory · Mathematics 2023-05-18 Andrew Fiori , Habiba Kadiri , Joshua Swidinsky

We establish estimates for the number of ways to represent any reduced residue class as a product of a prime and an integer free of small prime factors. Our best results is conditional on the Generalised Riemann hypothesis (GRH). As a…

Number Theory · Mathematics 2021-07-07 Kam Hung Yau

We study generalizations of some results of Jean-Louis Nicolas regarding the relation between small values of Euler's function $\varphi(n)$ and the Riemann Hypothesis. Among other things, we prove that for $1\leq q\leq 10$ and for $q=12,…

Number Theory · Mathematics 2018-10-30 Amir Akbary , Forrest J. Francis

Let $p$ be a prime number, and $h$ a positive integer such that $\gcd(p,h)=1$. We prove, without invoking Dirichlet's theorem, that the arithmetic progression $p\left(\mathbf{N}\cup \{0\}\right)+h$ contains infinitely many prime numbers.…

General Mathematics · Mathematics 2023-11-21 Jhixon Macías

We prove a kind of "almost all symmetry" result for the primes, i.e. we give non-trivial bounds for the "symmetry integral", say $I_{\Lambda}(N,h)$, of the von Mangoldt function $\Lambda(n)$ ($:= \log p$ for prime-powers $n=p^r$, 0…

Number Theory · Mathematics 2011-05-31 Giovanni Coppola

We show that for any fixed base $a$, a positive proportion of primes have the property that they become composite after altering any one of their digits in the base $a$ expansion; the case $a=2$ was already established by Cohen-Selfridge…

Number Theory · Mathematics 2010-04-20 Terence Tao

We provide a formula for the logarithmic density of the set of positive real numbers on which two prime counting functions $\psi(x;q,a)$ and $\psi(x;q,b)$ are simultaneously larger than their asymptotic main terms, as well as a method for…

Number Theory · Mathematics 2025-10-08 Kübra Benli , Greg Martin , Paul Péringuey

We study the $1$-level density and the pair correlation of zeros of quadratic Dirichlet $L$-functions in function fields, as we average over the ensemble $\mathcal{H}_{2g+1}$ of monic, square-free polynomials with coefficients in…

Number Theory · Mathematics 2016-05-24 Hung M. Bui , Alexandra Florea

We prove that neither a prime nor {an l-almost prime} number theorem hold in the class of regular Toeplitz subshifts. But, {when a quantitative strengthening of the regularity with respect to the periodic structure involving Euler's totient…

Dynamical Systems · Mathematics 2023-06-22 Krzysztof Frączek , Adam Kanigowski , Mariusz Lemańczyk

We show that both primes and smooth numbers are equidistributed in arithmetic progressions to moduli up to $x^{5/8 - o(1)}$, using triply-well-factorable weights for the primes (we also get improvements for the well-factorable linear sieve…

Number Theory · Mathematics 2025-07-01 Alexandru Pascadi