English
Related papers

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

200 papers

In this paper, we make some conjectures on prime numbers that are sharper than those found in the current literature. First we describe our studies on Legendre's Conjecture which is still unsolved. Next, we show that Brocard's Conjecture…

Number Theory · Mathematics 2009-06-02 Adway Mitra , Goutam Paul , Ushnish Sarkar

We present a new, elementary, dynamical proof of the prime number theorem.

Number Theory · Mathematics 2021-05-25 Redmond McNamara

We introduce a new set of prime numbers functions including an exact Generating Function and a Discriminating Function of Prime Numbers neither based on prime number tables nor on algorithms. Instead these functions are defined in terms of…

General Mathematics · Mathematics 2021-09-07 Eduardo Stella , Celso L Ladera , Guillermo Donoso

This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…

Number Theory · Mathematics 2023-09-18 N. A. Carella

We consider the regular parts for basic functions of prime numbers with Riemann approximation accuracy.

Number Theory · Mathematics 2007-05-23 R. M. Abrarov , S. M. Abrarov

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

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

Number Theory · Mathematics 2007-05-23 D. A. Goldston , J. Pintz , C. Y. Yildirim

Let $\varphi(n)$ denote the Euler totient function. In this paper, we first establish a new upper bound for $n/\varphi(n)$ involving $K(n)$, the function that counts the number of primorials not exceeding $n$. In particular, this leads to…

Number Theory · Mathematics 2024-06-07 Christian Axler

Let $N$ be the counting function of a Beurling generalized number system and let $\pi$ be the counting function of its primes. We show that the $L^{1}$-condition $$ \int_{1}^{\infty}|\frac{N(x)-ax}{x}|\frac{\mathrm{d}x}{x}<\infty $$ and the…

Number Theory · Mathematics 2013-05-02 Jasson Vindas

We implement the Maynard-Tao method of detecting primes in tuples to investigate small gaps between primes in arithmetic progressions, with bounds that are uniform over a range of moduli.

Number Theory · Mathematics 2015-09-01 Deniz Ali Kaptan

The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…

General Mathematics · Mathematics 2026-01-12 Yasuo Nishii

By employing certain extended classical summation theorems, several surprising \pi and other formulae are displayed.

Number Theory · Mathematics 2012-05-31 Yong Sup Kim , Xiaoxia Wang , Arjun K. Rathie

Most prime gaps results have been proven using tools from analytic or algebraic number theory in the last few centuries. In this paper, we would like to present some probabilistic way of proving many essential results. A major component of…

Number Theory · Mathematics 2022-10-21 Buxin Su

In the paper, the occurrence of zeros and ones in the binary expansion of the primes is studied. In particular the statement in the title is established. The proof is unconditional.

Number Theory · Mathematics 2012-11-16 Jean Bourgain

This work proposes a proof of the simplest cubic primes counting problem. It shows that the subset of primes {p = n^3 + 2 is prime : n => 1} is an infinite subset of primes. Further, the expected order of magnitude of the cubic primes…

General Mathematics · Mathematics 2013-02-20 N. A. Carella

The bounds for the ratios of first and second kind modified Bessel functions of consecutive orders are important quantities appearing in a large number of scientific applications. We obtain new bounds which are accurate in a large region of…

Classical Analysis and ODEs · Mathematics 2016-06-08 D. Ruiz-Antolin , J. Segura

Assuming the Riemann hypothesis, this article discusses a new elementary argument that seems to prove that the maximal prime gap of a finite sequence of primes p_1, p_2, ..., p_n <= x, satisfies max {p_(n+1) - p_n : p_n <= x} <=…

Number Theory · Mathematics 2010-09-01 N. A. Carella

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

This work advances knowledge of the threshold of prox-boundedness of a function; an important concern in the use of proximal point optimization algorithms and in determining the existence of the Moreau envelope of the function. In finite…

Optimization and Control · Mathematics 2019-09-12 Chayne Planiden

An analog of the Riemann hypothesis is proved in this paper. Some new integral equations for the functions $\pi(x)$ and $R(x)$ follows. A new effect that is shown is that these function - with essentially different behavior - are the…

Classical Analysis and ODEs · Mathematics 2011-09-06 Jan Moser