Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2409.00888

$M$-functions and screw functions originating from Goldbach's problem and zeros of the Riemann zeta function

Kohji Matsumoto·Masatoshi Suzuki
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the $M$-functions, which describe the limit theorem for the value-distributions of the secondary main terms in the asymptotic formulas for the summatory functions of the Goldbach counting function. One of the new aspects is a sufficient condition for the Riemann hypothesis provided by some formulas of the $M$-functions, which was a necessary condition in previous work. The other new aspect is the relation between the secondary main terms and the screw functions, which provides another necessary and sufficient condition for the Riemann hypothesis. We study such $M$-functions and screw functions in generalized settings by axiomatizing them.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kohji Matsumoto, Masatoshi Suzuki. 2025-10-20. $M$-functions and screw functions originating from Goldbach's problem and zeros of the Riemann zeta function. https://doi.org/10.1016/j.jnt.2025.09.013

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↗