Related papers: Criteria for Irrationality of Euler's Constant

Following Apery's proof of the irrationality of zeta(3), Beukers found an elegant reinterpretation of Apery's arguments using modular forms. We show how Beukers arguments can be adapted to a p-adic setting. In this context, certain…

In this note, we prove that for all $x \in (0 , 1)$, we have: $$ \log\Gamma(x) = \frac{1}{2} \log\pi + \pi \boldsymbol{\eta} \left(\frac{1}{2} - x\right) - \frac{1}{2} \log\sin(\pi x) + \frac{1}{\pi} \sum_{n = 1}^{\infty} \frac{\log n}{n}…

Let $\sigma(n)$ denotes the sum of divisors function of a positive integer $n$. Robin proved that the Riemann hypothesis is true if and only if the inequality $\sigma(n) < e^{\gamma}n \log \log n$ holds for every positive integer $n \geq…

In 2007, A.I.Aptekarev and his collaborators discovered a sequence of rational approximations to Euler's constant $\gamma$ defined by a linear recurrence. In this paper, we generalize this result and present an explicit construction of…

This survey text deals with irrationality, and linear independence over the rationals, of values at positive odd integers of Riemann zeta function. The first section gives all known proofs (and connections between them) of Ap\'ery's Theorem…

We believe that Euler constant is not just the "renormalized" value of the Riemann zeta function in 1. In a sense that we shall clarify it is in fact the normal and natural value of zeta of 1. In this paper we first propose a limit…

We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…

We prove that among 1 and the odd zeta values $\zeta(3)$, $\zeta(5)$, \ldots, $\zeta(s)$, at least $ 0.21 \sqrt{s}/\sqrt{\log s}$ are linearly independent over the rationals, for any sufficiently large odd integer $s$. This is the first…

We define the generalized-Euler-constant function $\gamma(z)=\sum_{n=1}^{\infty} z^{n-1} (\frac{1}{n}-\log \frac{n+1}{n})$ when $|z|\leq 1$. Its values include both Euler's constant $\gamma=\gamma(1)$ and the "alternating Euler constant"…

We prove that there are at least $1.284 \cdot \sqrt{s/\log s}$ irrational numbers among $\zeta(3)$, $\zeta(5)$, $\zeta(7)$, $\ldots$, $\zeta(s-1)$ for any sufficiently large even integer $s$. This result improves upon the previous finding…

Let \sigma(n) be the sum of divisors of a positive integer n. Robin's theorem states that the Riemann hypothesis is equivalent to the inequality \sigma(n)<e^\gamma n\log\log n for all n>5040 (\gamma is Euler's constant). It is a natural…

Robin's criterion states that the Riemann Hypothesis (RH) is true if and only if Robin's inequality $\sigma(n):=\sum_{p|n}p<e^{\gamma} n \log \log n$ is satisfied for $n > 5040$, where $\gamma$ denotes the Euler-Mascheroni constant. We show…

We have used the first 2600 nontrivial zeros gamma_l of the Riemann zeta function calculated with 1000 digits accuracy and developed them into the continued fractions. We calculated the geometrical means of the denominators of these…

In math.CA/0211148 we observed that $\ln(4/ \pi)$ is an "alternating" analog of Euler's constant $\gamma$. Here we use the binary expansion of an integer to give a rational series for $\ln(4/ \pi)$ analogous to Vacca's series for $\gamma$.…

A folklore proof of Euclid's theorem on the infinitude of primes uses the Euler product and the irrationality of $\zeta(2) = \pi^2/6$. A quantified form of Euclid's Theorem is Bertrand's postulate $p_{n+1} < 2p_n$. By quantifying the…

Available proofs of result of the type 'at least one of the odd zeta values $\zeta(5),\zeta(7),\dots,\zeta(s)$ is irrational' make use of the saddle-point method or of linear independence criteria, or both. These two remarkable techniques…

The transformations of the sum identities for generalized harmonic and oscillatory numbers, obtained earlier in our recent report [1], enable us to derive the new identities expressed in terms of the corresponding square roots of x. At…

Let $d(n)$ be the number of divisors of $n$, let $\gamma$ denote Euler's constant and $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote…

The conjectured Robin inequality for an integer $n>7!$ is $\sigma(n)<e^\gamma n \log \log n,$ where $\gamma$ denotes Euler constant, and $\sigma(n)=\sum_{d | n} d $. Robin proved that this conjecture is equivalent to Riemann hypothesis…

The aim of the paper is to relate computational and arithmetic questions about Euler's constant $\gamma$ with properties of the values of the $q$-logarithm function, with natural choice of $q$. By these means, we generalize a classical…