Related papers: A multimodular algorithm for computing Bernoulli n…
This article gives a direct formula for the computation of B(n) using the asymptotic formula $$B (n) \approx 2 {\frac {n!}{{\pi}^{n}{2}^{n}}}$$ where n is even and $n >> 1$. This is simply based on the fact that $\zeta (n)$ is very near 1…
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…
We describe a new algorithm that computes the n-th Bernoulli number in n^(4/3 + o(1)) bit operations. This improves on previous algorithms that had complexity n^(2 + o(1)).
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 describe a method to accelerate the numerical computation of the coefficients of the polynomials $P_k(x)$ that appear in the conjectured asymptotics of the $2k$-th moment of the Riemann zeta function. We carried out our method to compute…
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…
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…
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…
In previous work, the author has extended the concept of regular and irregular primes to the setting of arbitrary totally real number fields k_{0}, using the values of the zeta function \zeta_{k_{0}} at negative integers as our ``higher…
Let $p>3$ be a prime. For any $p$-adic integer $a$, we determine $$\sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}kH_k,\ \ \sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}kH_k^{(2)},\ \ \sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}k\frac{H_k^{(2)}}{2k+1}$$ modulo…
This paper describes recent advances in the combinatorial method for computing $\pi(x)$, the number of primes $\leq x$. In particular, the memory usage has been reduced by a factor of $\log x$, and modifications for shared- and…
We present a new formula for the Bernoulli numbers as the following integral $$B_{2m} =\frac{(-1)^{m-1}}{2^{2m+1}} \int_{-\infty}^{+\infty} (\frac{d^{m-1}}{dx^{m-1}} {sech}^2 x)^2dx. $$ This formula is motivated by the results of Fairlie…
We present a space-efficient algorithm to compute the Hilbert class polynomial H_D(X) modulo a positive integer P, based on an explicit form of the Chinese Remainder Theorem. Under the Generalized Riemann Hypothesis, the algorithm uses…
Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^n - 2^k + 1$, originally…
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…
We investigate the asymptotic number of elements of size $n$ in a particular class of closed lambda-terms (so-called $BCI(p)$-terms) which are related to axiom systems of combinatory logic. By deriving a differential equation for the…
Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…
This paper introduces two forms of modular inverses and proves their reciprocity formulas respectively. These formulas are then applied to formulate new and generalized algorithm for computing these modular inverses. The same algorithm is…
In this paper, we consstruct a new extended q-Bernoulli numbers and poly nomials. From these numbers, we derive the multiple zeta functions and give some relations between multiple Bernoulli numbers and multiple zeta functions.