Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1811.05861

Approximation of the derivatives of the logarithm of the Riemann zeta-function in the critical strip

Sergey Sekatskii·Stefano Beltraminelli
View original source ↗Read source document ↗Export metadata ↓

Abstract

Recently, we have established the generalized Li criterion equivalent to the Riemann hypothesis, viz. demonstrated that the sums over all non-trivial Riemann function zeroes k_n,a=Sum_(/rho)(1-(1-((/rho-a)/(/rho+a-1))^n) for any real a not equal to 1/2 are non-negative if and only if the Riemann hypothesis holds true, and proved the relation k_n,a=n*(1-2a)/(n-1)!*d^n/dz^n((z-a)^(n-1)*ln(ξ(z))) taken at z=1-a. Assuming that the function /zeta(s) is non-vanishing for Re(s)>1/2+/Delta, where real 0 Re(a)>1/2+/Delta+delta_0, where /delta_0 is an arbitrary small fixed positive number, one has d^n/ds^n(ln(/zeta(s))=Sum_(m<=N)((-1)^n*/Lambda(m)*ln^(n-1)(m)/m^a) + Int_(0)^(N)(x^(-a)*ln^(n-1)(x)*dx)+O(N^(1/2+Delta-a)*ln^(n-1)(N)); derivative is taken at s=a. In particular, d(ln(/zeta(a))/da=-Sum_(m<=N)(/Lambda(m)/m^a+N^(1-a)/(1-a)+O(N^(1/2+/Delta-a)). Numerical verifications of these equalities are also presented.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergey Sekatskii, Stefano Beltraminelli. 2018-11-14. Approximation of the derivatives of the logarithm of the Riemann zeta-function in the critical strip. https://arxiv.org/abs/1811.05861

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↗