Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.27282

The exceptional set of the Goldbach problem

Gautami Bhowmik·Lasse Grimmelt
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the estimates for the number of exceptions to the representation of integers as the sum of at most two prime numbers. Most of this article is a survey that gives an overview of existing results. We begin with the legendary Hardy-Littlewood circle method and show how it paved the way to a power saving by Montgomery-Vaughan in 1975 and Pintz in 2018. We conclude with a new result that is a fully explicit formula for the major arcs. Another new observation is the non-existence of exceptional zeros under a sparse version of the Hardy-Littlewood conjecture. The survey part of this article aims to be accessible to an audience that has not encountered these techniques before.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gautami Bhowmik, Lasse Grimmelt. 2026-08-13. The exceptional set of the Goldbach problem. https://arxiv.org/abs/2607.27282

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↗