English
Related papers

Related papers: New bounds for the prime counting function \pi(x)

200 papers

We fix a gap in our proof of an upper bound for the number of positive integers $n\le x$ for which the Euler function $\varphi(n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result.

Number Theory · Mathematics 2018-09-06 W. D. Banks , J. B. Friedlander , C. Pomerance , I. E. Shparlinski

We study the average distribution of primes of size $x$ in arithmetic progressions to moduli larger than $x^{\frac{1}{2}}$. Using arithmetic information from the works of many authors together with different variants of the original…

Number Theory · Mathematics 2026-05-28 Runbo Li

This note states and proves a representation theorem for regular quantity functions, based on the theory of quantity spaces, thereby giving a new perspective on dimensional analysis and the classical $\pi$ theorem.

Rings and Algebras · Mathematics 2020-05-22 Dan Jonsson

We present an elementary self-contained folkloristic proof, using limits of primitives of Bernstein polynomials, for the existence of primitive functions of continuous functions defined on the unit interval.

Classical Analysis and ODEs · Mathematics 2022-04-12 Patrik Lundström

We give an account of the arguments that lead from the assumption of the existence of exceptional characters to the asymptotics in related ranges for the counting function of twin primes.

Number Theory · Mathematics 2016-07-13 John B. Friedlander , Henryk Iwaniec

We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.

Number Theory · Mathematics 2015-11-09 Jan Büthe

We prove that if $x$ is large enough, namely $x\ge x_0$, then there exists a prime between $x(1- \Delta^{-1})$ and $x$, where $\Delta$ is an effective constant computed in terms of $x_0$. This improves some previous results of Ramar\'e and…

Number Theory · Mathematics 2019-03-06 Habiba Kadiri , Allysa Lumley

We formulate, using heuristic reasoning, precise conjectures for the range of the number of primes in intervals of length $y$ around $x$, where $y\ll (\log x)^2$. In particular we conjecture that the maximum grows surprisingly slowly as $y$…

Number Theory · Mathematics 2021-05-05 Andrew Granville , Allysa Lumley

The Lambert W function, implicitly defined by W(x) exp{W(x)}=x, is a "new" special function that has recently been the subject of an extended upsurge in interest and applications. In this note, I point out that the Lambert W function can…

Number Theory · Mathematics 2018-04-10 Matt Visser

We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…

Number Theory · Mathematics 2020-12-08 Marco Cantarini , Alessandro Gambini , Alessandro Zaccagnini

We examine the prime gaps using a statistical approach. It is first shown that the Andrica's conjecture is true for half or more cases. Using the arguments of averages, it is further shown that Andrica's conjecture is true. We further…

General Mathematics · Mathematics 2017-03-01 Sameen Ahmed Khan

We survey the classical results on the prime number theorem

Number Theory · Mathematics 2007-05-23 Yong-Cheol Kim

The main goal of this research is to model and investigate generalizations of functions from [31]. Arguments of modeled functions are presented by the representation $\pi_{\mathfrak p}$ from [22].

General Mathematics · Mathematics 2025-05-30 Symon Serbenyuk

We present in this work a heuristic expression for the density of prime numbers. Our expression leads to results which possesses approximately the same precision of the Riemann's function in the domain that goes from 2 to 1010 at least.…

General Mathematics · Mathematics 2008-03-05 L. A. Amarante Ribeiro

This article determines a lower bound for the number Germain primes $p$ and $2p+1$ up to a large number $x$.

General Mathematics · Mathematics 2023-07-13 N. A. Carella

Let [t] be the integral part of the real number t and let 1 P be the characteristic function of the primes. Denote by $\pi$ G (x) the number of primes in the floor function set G(x) := {[ x n ] : 1 n x} and by S 1 P (x) the number of primes…

Number Theory · Mathematics 2021-12-30 Rong Ma , Jie Wu

Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…

Number Theory · Mathematics 2022-01-06 Błażej Żmija

We establish lower bounds for all weighted even moments of primes up to $X$ in intervals which are in agreement with a conjecture of Montgomery and Soundararajan. Our bounds hold unconditionally for an unbounded set of values of $X$, and…

Number Theory · Mathematics 2020-09-15 Régis de la Bretèche , Daniel Fiorilli

In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.

Number Theory · Mathematics 2007-05-23 L. J. P. Kilford

Let $(R, m)$ be a $d$-dimensional Cohen-Macaulay local ring. In this note we prove, in a very elementary way, an upper bound of the first normalized Hilbert coefficient of a $m$-primary ideal $I\subset R$ that improves all known upper…

Commutative Algebra · Mathematics 2019-05-01 Juan Elias