Search arXivSearch

arXiv · 2103.09418

On some results of Agelas concerning the GRH and of Vassilev-Missana concerning the prime zeta function

Abstract

A recent paper by Agélas [Generalized Riemann Hypothesis, 2019, hal-00747680v3] claims to prove the Generalized Riemann Hypothesis (GRH) and, as a special case, the Riemann Hypothesis (RH). We show that the proof given by Agélas contains an error. In particular, Lemma 2.3 of Agélas is false. This Lemma 2.3 is a generalisation of Theorem 1 of Vassilev-Missana [A note on prime zeta function and Riemann zeta function, Notes on Number Theory and Discrete Mathematics, 22, 4 (2016), 12-15]. We show by several independent methods that Theorem 1 of Vassilev-Missana is false. We also show that Theorem 2 of Vassilev-Missana is false. This note has two aims. The first aim is to alert other researchers to these errors so they do not rely on faulty results in their own work. The second aim is pedagogical - we hope to show how these errors could have been detected earlier, which may suggest how similar errors can be avoided, or at least detected at an early stage.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Richard P. Brent. 2021-03-21. On some results of Agelas concerning the GRH and of Vassilev-Missana concerning the prime zeta function. https://doi.org/10.7546/nntdm.2021.27.2.49-50

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