English
Related papers

Related papers: Primes between consecutive powers

200 papers

In this paper we establish a function field analogue of a conjecture in number theory which is a combination of several famous conjectures, including the Hardy-Littlewood prime tuple conjecture, conjectures on the number of primes in…

Number Theory · Mathematics 2014-10-07 Efrat Bank , Lior Bary-Soroker

A calculation was performed to verify Proth-Gilbraith's conjecture for all prime numbers up to 0$^{14}$. The previous calculation was performed by Andrew Odlyzko in 1993 up to 0$^{13}$. This involves calculating the differences between…

Number Theory · Mathematics 2025-10-28 Simon Plouffe

In this paper we extend the well-known investigations of Montgomery and Goldston & Montgomery, concerning the pair-correlation function and its relations with the distribution of primes in short intervals, to a more general version of the…

Number Theory · Mathematics 2017-05-12 A. Languasco , A. Perelli , A. Zaccagnini

Zhang has shown there are infinitely many intervals of bounded length containing two primes. It appears that the current techniques cannot prove that there are infinitely many intervals of bounded length containing three primes, even if…

Number Theory · Mathematics 2013-06-06 James Maynard

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

By involving some exponential sums related to $\Lambda(n)$ in arithmetic progression, we can obtain some new results for von Mangoldt function over {\bf nonhomogeneous} Beatty sequences in arithmetic progressions, which improve some recent…

Number Theory · Mathematics 2025-02-11 Wei Zhang

Under the assumption of infinitely many Siegel zeroes $s$ with $Re(s)>1-\frac{1}{(\log q)^{R}}$ for a sufficiently large value of $R$, we prove that there exist infinitely many $m$-tuples of primes that are $\ll e^{1.9828m}$ apart. This…

Number Theory · Mathematics 2024-03-06 Thomas Wright

We posit that $d_n^2 < 2p_{n+1}$ holds for all $n\geq 1$, where $p_n$ represents the $n$th prime and $d_n$ stands for the $n$th prime gap i.e. $d_n := p_{n+1} - p_n$. Then, the presence of a prime between successive perfect squares, as well…

Number Theory · Mathematics 2025-09-01 Jacques Grah

We consider the linear combinations of elements of two sequences: the first one a priory given nonnegative sequence and the second random sequence from the unit interval. We investigate the expected value of the smallest natural number such…

Classical Analysis and ODEs · Mathematics 2013-04-11 Predrag M. Rajkovic , Sladjana D. Marinkovic , Miomir S. Stankovic

The paper considers the asymptotic of the ratio of the number of primes not exceeding the primorial and the number of residues in the reduced system of residues for the given primorial. We study the relationship between asymptotic lower…

General Mathematics · Mathematics 2022-11-28 Victor Volfson

We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…

Number Theory · Mathematics 2015-09-08 Janos Pintz

We studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained…

Number Theory · Mathematics 2015-09-30 Victor Volfson

The $n$th Ramanujan prime is the smallest positive integer $R_n$ such that if $x \ge R_n$, then the interval $(x/2,x]$ contains at least $n$ primes. We sharpen Laishram's theorem that $R_n < p_{3n}$ by proving that the maximum of…

Number Theory · Mathematics 2011-08-02 Jonathan Sondow , John W. Nicholson , Tony D. Noe

The arithmetic average of the first $n$ primes, $\bar p_n = {1\over n} \sum_{i=1}^n p_i$, exhibits very many interesting and subtle properties. Since the transformation from $p_n \to \bar p_n$ is extremely easy to invert, $p_n = n\bar p_n -…

Number Theory · Mathematics 2025-07-17 Matt Visser

We study the surprising discrepancy between the number of primes corresponding, respectively, to the two letters of an infinite word engendered by one of the simplest Lindenmayer systems. We formulate a conjecture concerning the rate of…

Number Theory · Mathematics 2008-03-07 Andrei Vieru

Combining the Hardy-Littlewood k-tuple conjecture with a heuristic application of extreme-value statistics, we propose a family of estimator formulas for predicting maximal gaps between prime k-tuples. Computations show that the estimator…

Number Theory · Mathematics 2013-05-14 Alexei Kourbatov

We provide a new hybrid estimation of single exponential sums, combining Van der Corput, Huxley and Bourgain's result. We also focus on primes in short intervals $(x-x^{\alpha},x]$ under the assumption of the existence of exceptional…

Number Theory · Mathematics 2024-02-09 Runbo Li

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

We study the first occurrences of gaps between primes in the arithmetic progression (P): $r$, $r+q$, $r+2q$, $r+3q,\ldots,$ where $q$ and $r$ are coprime integers, $q>r\ge1$. The growth trend and distribution of the first-occurrence gap…

Number Theory · Mathematics 2020-10-22 Alexei Kourbatov , Marek Wolf

We prove some results concerning the distribution of primes on the Riemann hypothesis. First, we prove the explicit result that there exists a prime in the interval $(x-\frac{4}{\pi} \sqrt{x} \log x,x]$ for all $x \geq 2$; this improves a…

Number Theory · Mathematics 2014-05-22 Adrian Dudek