Related papers: An efficient algorithm for the computation of Bern…
We describe an algorithm for computing Bernoulli numbers. Using a parallel implementation, we have computed B(k) for k = 10^8, a new record. Our method is to compute B(k) modulo p for many small primes p, and then reconstruct B(k) via the…
In this work we introduce a new polynomial representation of the Bernoulli numbers in terms of polynomial sums allowing on the one hand a more detailed understanding of their mathematical structure and on the other hand provides a…
An alternative formula is presented for the evaluation of the zeta function values $\zeta(2k)$ without the need for Bernoulli numbers. Our formula is recursive, and improves the efficiency with which we can calculate large values of the…
In this paper, by introducing a new operation in the vector space of analytic functions, the author presents a method for derivating the well-known formulas: $\zeta(1-k)=-\frac{B_k}{k}$ and $\zeta(1-n,a)=-\frac{B_n(a)}{n}$ , where $\zeta$,…
We present new sharper lower and upper bounds for the non-zero Bernoulli numbers using Euler's formula for the Riemann zeta function. In particular, we determine the best possible constants $ \alpha $ and $ \beta $ such that the double…
In 1998 Don Zagier introduced the modified Bernoulli numbers $B_{n}^{*}$ and showed that they satisfy amusing variants of some properties of Bernoulli numbers. In particular, he studied the asymptotic behavior of $B_{2n}^{*}$, and also…
We present a new proof of Euler's formulas for $\zeta(2k)$, where $k = 1,2,3,...$, which uses only the defining properties of the Bernoulli polynomials, obtaining the value of $\zeta(2k)$ by summing a telescoping series. Only basic…
A generalization of a well-known relation between the Riemann zeta function $\zeta(s)$ and Bernoulli numbers $B_n$ is obtained. The formula is a new representation of the Riemann zeta function in terms of a nested series of Bernoulli…
By using an asymptotic formula known for the numbers of Euler and Bernoulli it is possible to obtain an explicit expression of the nth digit of $\pi$ in decimal or in binary, it also makes it possible to obtain the $n^{\rm th}$ digit of…
The method analytic continuation of operators acting integer n-times to complex s-times (hep-th/9707206) is applied to an operator that generates Bernoulli numbers B_n (Math. Mag. 70(1), 51 (1997)). B_n and Bernoulli polynomials B_n(s) are…
We consider the computation of Bernoulli, Tangent (zag), and Secant (zig or Euler) numbers. In particular, we give asymptotically fast algorithms for computing the first n such numbers in O(n^2.(log n)^(2+o(1))) bit-operations. We also give…
We introduce a Bernoulli operator,let $\mathbf{B}$ denote the operator symbol,for n=0,1,2,3,... let ${\mathbf{B}^n}: = {B_n}$ (where ${B_n}$ are Bernoulli numbers,${B_0} = 1,B{}_1 = 1/2,{B_2} = 1/6,{B_3} = 0$...).We obtain some formulas for…
We establish a connection between a function and a series representation using a similar technique with that that Euler used to solve the Basel problem. Our result concerns a more general series from which one can obtain $\zeta(2k)$ as a…
We have rediscovered a simple algorithm to compute the mathematical constant \[ \pi=3.14159265\cdots. \] The algorithm had been known for a long time but it might not be recognized as a fast, practical algorithm. The time complexity of it…
A method for computing the n'th decimal digit of pi in O(n^3 log(n)^3) time and with very little memory is presented here. The computation is based on the recently discovered Bailey-Borwein-Plouffe algorithm and the use of a new algorithm…
Already in 1734 Euler found a short explicit formula for the value of Riemann zeta function Zeta(s) when the argument s equals a positive integer 2n where n=1,2,3,. No such formula exists for odd positive integer arguments of Zeta. The…
In this shortnote, a series expansion technique introduced recently by Dancs and He for generating Euler-type formulae for odd zeta values $\:\zeta{(2 k +1)}$, $\zeta{(s)}$ being the Riemann zeta function and $k$ a positive integer, is…
In this article, we introduce a recurrence formula which only involves two adjacent values of the Riemann zeta function at integer arguments. Based on the formula, an algorithm to evaluate $\zeta$-values(i.e. the values of Riemann zeta…
We consider computing the Riemann zeta function $\zeta(s)$ and Dirichlet $L$-functions $L(s,\chi)$ to $p$-bit accuracy for large $p$. Using the approximate functional equation together with asymptotically fast computation of the incomplete…
Using Parseval's identity for the Fourier coefficients of $x^k$, we provide a new proof that $\zeta(2k)=\dfrac{(-1)^{k+1}B_{2k}(2\pi)^{2k}}{2(2k)!}$.