Search arXivSearch

arXiv · 1306.6775

ζ({{2}^m, 1, {2}^m, 3}^n, {2}^m) / π^{4n + 2m(2n+1)} is rational

Abstract

The cyclic insertion conjecture of Borwein, Bradley, Broadhurst and Lisoněk states that inserting all cyclic shifts of some fixed blocks of 2's into the multiple zeta value ζ(1,3,...,1,3) gives an explicit rational multiple of a power of π. In this paper we use motivic multiple zeta values to establish a non-explicit symmetric insertion result: inserting all possible permutations of some fixed blocks of 2's into ζ(1,3,...,1,3) gives some rational multiple of a power of π.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Steven Charlton. 2013-06-28. ζ({{2}^m, 1, {2}^m, 3}^n, {2}^m) / π^{4n + 2m(2n+1)} is rational. https://doi.org/10.1016/j.jnt.2014.09.028

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