中文
相关论文

相关论文: Small gaps between prime numbers: The work of Gold…

200 篇论文

This is an exposition, in 12 pages including all prerequisites and a generalization, of Karamata's little known elementary proof of the Landau-Ingham Tauberian theorem, a result in real analysis from which the Prime Number Theorem follows…

数论 · 数学 2016-12-07 Michael Mueger

Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…

历史与综述 · 数学 2020-02-04 Alberto Fraile , Roberto Martinez , Daniel Fernandez

We present a collection of results concerning the location and distribution of very triangular numbers among triangular numbers, including the twin very triangular number theorem, the existence of arbitrarily long gaps between -- and an…

历史与综述 · 数学 2023-08-31 Audrey Baumheckel , Tamás Forgács

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

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…

数论 · 数学 2019-03-06 Habiba Kadiri , Allysa Lumley

Logarithmic gaps have been used in order to find a periodic component of the sequence of prime numbers, hidden by a random noise (stochastic or chaotic). The recovered period for the sequence of the first 10000 prime numbers is equal to…

数论 · 数学 2011-05-10 A. Bershadskii

In this paper we prove that the binary Goldbach conjecture for sufficiently large even integers would follow under the assumption that both the Elliott-Halberstam conjecture and a variant of the Elliott-Halberstam conjecture twisted by the…

数论 · 数学 2022-08-30 Jing-Jing Huang , Huixi Li

In 1999, Balog, Br\"udern, and Wooley (1999) showed there are infinitely many prime gaps $p-q$ that are $(\log p)^{\frac{3}{4}}$-smooth, and infinitely many consecutive prime gaps that are $(\log p)^\frac{7}{8}$-smooth. Advancements made…

数论 · 数学 2024-10-15 Carol Wu

Let $(a_n)_{n \geq 1}$ be a sequence of distinct positive integers. The metric theory of minimal gaps for the sequence $\{\alpha a_n \text{ mod }1, 1\leq n \leq N\}$ as $N \to \infty$ was initiated by Rudnick, who established that the…

数论 · 数学 2025-11-25 Jewel Mahajan

Cyclotomic polynomials play fundamental roles in number theory, combinatorics, algebra and their applications. Hence their properties have been extensively investigated. In this paper, we study the maximum gap $g$ (maximum of the…

数论 · 数学 2020-01-24 Ala'a Al-Kateeb , Mary Ambrosino , Hoon Hong , Eunjeong Lee

Definition of the number of prime numbers in the given interval

综合数学 · 数学 2013-10-30 Nariman Sabziyev

We prove that given $\lambda \in \mathbb{R}$ such that $0 < \lambda < 1$, then $\pi(x + x^\lambda) - \pi(x) \sim \displaystyle \frac{x^\lambda}{\log(x)}$. This solves a long-standing problem concerning the existence of primes in short…

数论 · 数学 2026-05-08 Luan Alberto Ferreira

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.

数论 · 数学 2015-09-01 Deniz Ali Kaptan

Prime numbers have attracted the attention of mathematiciansand enthusiasts for millenniums due to their simple definition and remarkable properties. In this paper, we study primorial numbers (the product of the first prime numbers) to…

数论 · 数学 2023-01-10 Jonatan Gomez

We show that for all large enough $x$ the interval $[x,x+x^{1/2}\log^{1.39}x]$ contains numbers with a prime factor $p > x^{18/19}.$ Our work builds on the previous works of Heath-Brown and Jia (1998) and Jia and Liu (2000) concerning the…

数论 · 数学 2021-01-20 Jori Merikoski

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…

数论 · 数学 2007-09-23 Ben Green , Terence Tao

It is a well-known fact that for any natural number $n$, there always exists a prime in $[n, 2n]$. Our aim in this note is to generalize this result to $[n, kn]$. A lower as well as an upper bound on the number of primes in $[n, kn]$ were…

数论 · 数学 2019-08-21 Madhuparna Das , Goutam Paul

The problem of the least prime number in an arithmetic progression is one of the most important topics in Number Theory. In [11], we are the first to study the relations between this problem and Goldbach's conjecture. In this paper, we…

综合数学 · 数学 2010-02-03 Shaohua Zhang

We correct a small gap found in the authors' paper 'On bounds for the effective differential Nullstellensatz' (J Algebra 449:1-21, 2016). This gap is due to an inequality that does not generally hold. However, under one additional…

交换代数 · 数学 2020-11-17 Omar Leon Sanchez , Alexey Ovchinnikov

In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…

数论 · 数学 2023-02-07 Ameneh Farhadian , Hamid Reza Fanai