中文
相关论文

相关论文: Small Gaps Between Primes I

200 篇论文

The goal of the present paper is to present a method of proving of Diophantine inequalities with primes through the use of auxiliary inequalities and available evaluations of the difference between consecutive primes. We study the Legendre…

数论 · 数学 2015-10-08 Felix Sidokhine

We prove an analogue of the Prime Number Theorem for short intervals on a smooth projective geometrically irreducible curve of arbitrary genus over a finite field. A short interval "of size E" in this setting is any additive translate of…

数论 · 数学 2018-04-03 Efrat Bank , Tyler Foster

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…

综合数学 · 数学 2017-03-01 Sameen Ahmed Khan

The difference between two consecutive prime numbers is called the distance between the primes. We study the statistical properties of the distances and their increments (the difference between two consecutive distances) for a sequence…

统计力学 · 物理学 2007-05-23 Pradeep Kumar , Plamen Ch. Ivanov , H. Eugene Stanley

Let $k\geq 2$ be a fixed natural number. We establish the existence of infinitely many pairs of consecutive primes $p_n$, $p_{n+1}$ satisfying $$ p_{n+1}-p_n\geq c\:\frac{\log p_n\: \log_2 p_n\: \log_4 p_n}{\log_3 p_n}\:,$$ with $c$ being a…

数论 · 数学 2016-03-10 Helmut Maier , Michael Th. Rassias

Assuming the Riemann Hypothesis, we derive explicit bounds for the error terms in short interval analogues of the prime number theorem and Mertens' theorems using a smoothing argument. Our results improve upon previous bounds in both…

数论 · 数学 2025-10-30 Ethan Simpson Lee

In this paper, we improve the moment estimates for the gaps between numbers that can be represented as a sum of two squares of integers. We consider certain sum of Bessel functions and prove the upper bound for its weighted mean value. This…

数论 · 数学 2019-08-15 Alexander Kalmynin

Let $p_1 = 2, p_2 = 3,...$ be the sequence of all primes. Let $\epsilon$ be an arbitrarily small but fixed positive number, and fix a coprime pair of integers $q \ge 3$ and $a$. We will establish a lower bound for the number of primes…

数论 · 数学 2011-11-01 Tristan Freiberg

In this paper we prove the mean values of some multiplicative functions connected with the divisor function on the short interval of summation.

数论 · 数学 2016-11-04 A. A. Sedunova

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…

数论 · 数学 2022-10-21 Buxin Su

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…

数论 · 数学 2013-05-14 Alexei Kourbatov

A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which are known…

数论 · 数学 2013-12-10 Fred B. Holt , Helgi Rudd

We obtain the general k-correlations for a short divisor sum related to primes.

数论 · 数学 2016-09-07 Daniel A. Goldston , Cem Yalcin Yildirim

The distribution of differences of consecutive members of sequences of primes is investigated. A quantitative measure for oscillations among these differences is the curvature of the sequence. If the sequence is not too sparse, then sharp…

数论 · 数学 2017-02-02 Jörg Brüdern , Christian Elsholtz

In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…

数论 · 数学 2015-11-03 Efrat Bank , Lior Bary-Soroker , Lior Rosenzweig

Exact summatory functions that count the number of prime $k$-tuples up to some cut-off integer are presented. Related summatory $k$-tuple analogs of the first and second Chebyshev functions are then defined. Using a gamma distribution…

数论 · 数学 2014-07-08 J. LaChapelle

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).…

数论 · 数学 2016-01-27 Roger C. Baker , Liangyi Zhao

We prove that a suitable explicit formula for the Cesaro-averaged number of representations of an integer as a sum of two primes holds in short intervals.

数论 · 数学 2017-07-28 Alessandro Languasco , Alessandro Zaccagnini

In the recent preprint [3], Goldston, Pintz, and Y{\i}ld{\i}r{\i}m established, among other things, $$ \liminf_{n\to\infty}{p_{n+1}-p_n\over\log p_n}=0,\leqno(0) $$ with $p_n$ the $n$th prime. In the present article, which is essentially…

数论 · 数学 2007-05-23 D. A. Goldston , Y. Motohashi , J. Pintz , C. Y. Yildirim

Let $K$ be a finite Galois extension of $\mathbb{Q}$. We count primes in short intervals represented by the norm of a prime ideal of $K$ satisfying a small sector condition determined by Hecke characters. We also show that such primes are…