Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2402.07176

Recent results on large gaps between primes

Michael Th. Rassias
View original source ↗Read source document ↗Export metadata ↓

Abstract

One of the themes of this paper is recent results on large gaps between primes. The first of these results has been achieved in the paper [12] by Ford, Green, Konyagin and Tao. It was later improved in the joint paper [13] of these four authors with Maynard. One of the main ingredients of these results are old methods due to Erdős and Rankin. Other ingredients are important breakthrough results due to Goldston, Pintz and Yildirim [15, 16, 17], and their extension by Maynard on small gaps between primes. All these previous results are discussed shortly. The results on the appearance of $k$-th powers of primes contained in those large gaps, obtained by the author in joint work with Maier [23, 24, 25] are based on a combination of the results just described with the matrix method of Maier.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Th. Rassias. 2024-08-30. Recent results on large gaps between primes. https://arxiv.org/abs/2402.07176

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT↗
arXiv2026

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT↗