Search arXivSearch

arXiv · 1906.07628

On the Uniform Distribution (mod 1) of the Farey Sequence, quadratic Farey and Riemann sums with a remark on local integrals of $ζ(s)$

Abstract

For $1$-periodic functions $f$ satisfying only a weak local regularity assumption of Dini's type at rational points of $]0,1[$, we study the Farey sums $$F_n(f)= \sum_{\frac{\k}ł\in \F_n} f\big(\frac{\k}ł\big),\qq F_{n,\s}(f)= \sum_{\frac{\k}ł\in \F_n} \frac{1}{\k^\sł^\s}f\big(\frac{\k}ł\big),\qq 1/2\le \s<1 , $$ where $\F_n$ is the Farey series of order $n\ge 1$. We obtain sharp estimates of $F_{n,\s}(f)$, for all $0< \s\le1$. We prove similar results for the corresponding Riemann quadratic sums $$ S_{n,\s}(f) \ =\ \sum_{1\le k\le \ell \le n}\frac{1}{(k\ell)^{\s }}\, f\big( \frac{k}{\ell}\big). $$ These sums are related to local integrals of the Riemann zeta-function over bounded intervals $I$, which are considered in the last part of the paper.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michel Weber. 2019-06-18. On the Uniform Distribution (mod 1) of the Farey Sequence, quadratic Farey and Riemann sums with a remark on local integrals of $ζ(s)$. https://arxiv.org/abs/1906.07628

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