Search arXivSearch

arXiv · 1209.4329

On quotients of Riemann zeta values at odd and even integer arguments

Abstract

We show for even positive integers $n$ that the quotient of the Riemann zeta values $ζ(n+1)$ and $ζ(n)$ satisfies the equation $$\frac{ζ(n+1)}{ζ(n)} = (1-\frac{1}{n}) (1-\frac{1}{2^{n+1}-1}) \frac{\mathcal{L}^\star(\mathfrak{p}_n)}{\mathfrak{p}_n'(0)},$$ where $\mathfrak{p}_n \in \mathbb{Z}[x]$ is a certain monic polynomial of degree $n$ and $\mathcal{L}^\star: \mathbb{C}[x] \to \mathbb{C}$ is a linear functional, which is connected with a special Dirichlet series. There exists the decomposition $\mathfrak{p}_n(x) = x(x+1) \mathfrak{q}_n(x)$. If $n = p+1$ where $p$ is an odd prime, then $\mathfrak{q}_n$ is an Eisenstein polynomial and therefore irreducible over $\mathbb{Z}[x]$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bernd C. Kellner. 2014-10-29. On quotients of Riemann zeta values at odd and even integer arguments. https://doi.org/10.1016/j.jnt.2013.02.008

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