Search arXivSearch

arXiv · 2608.12400

A conditional arithmetic obstruction to the prime numbers as a spectrum of a probability measure

Abstract

Let $\Pp=\{2,3,5,7,\ldots\}$ denote the set of prime numbers. We prove that if every sufficiently large positive even integer can be represented as a difference of two primes, then there is no Borel probability measure $μ$ on $\R$ for which \(\left\{e^{2πi p x}:p\in\Pp\right\}\) is an orthonormal basis of $L^2(μ)$. In particular, under the Polignac conjecture, the prime numbers $\Pp$ cannot be a spectrum (i.e., the set of frequencies of an exponential orthonormal basis) of any probability measure on $\R$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhi-Yi Wu, Qian Zhao. 2026-08-09. A conditional arithmetic obstruction to the prime numbers as a spectrum of a probability measure. https://arxiv.org/abs/2608.12400

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

KEEP EXPLORING

Related papers

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

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