相关论文: An efficient algorithm for the computation of Bern…
The Riemann zeta function can be written as the Mellin transform of the unit interval map w(x) = floor(1/x)*(-1+x*floor(1/x)+x) multiplied by s((s+1)/(s-1)). A finite-sum approximation to \zeta (s) denoted by \zeta_w(N;s) which has real…
Historically known as the Basel problem, evaluating the Riemann zeta function at two has resulted in numerous proofs, many of which have been generalized to compute the function's values at even positive integers. We apply Parseval's…
Let $d_{\alpha, \beta}(n)=\sum\limits_{\substack{n=kl \alpha l<k\leq\beta l}}1$ be the number of ways of factoring n into two almost equal integers. For rational numbers $0<\alpha <\beta $, we consider the following Zeta function…
The beta integral is applied to accelerate the hypergeometric function $2 F 1\left\{1, B; C ; w\right\}$ to derive new infinite series for constants such as $\pi$ and values of the gamma function. A compendium of new infinite series is…
In this paper, the asymptotic formulas for Eulerian numbers, refined Eulerian numbers and the coefficients of descent polynomials are obtained directly from the spline interpretations of these numbers. Having related these numbers directly…
We solve an interpolation problem for computing $\zeta(2n)$ in a rather elementary way, by generalizing the main idea in \cite{SE}.
A new definition for the Riemann zeta function for all positive integer number s > 1 is presented. We discover a most elegant expression and easy method for calculating the Riemann zeta function for small even integer values. Through this…
Fix $\delta\in(0,1]$, $\sigma_0\in[0,1)$ and a real-valued function $\varepsilon(x)$ for which $\limsup_{x\to\infty}\varepsilon(x)\le 0$. For every set of primes ${\mathcal P}$ whose counting function $\pi_{\mathcal P}(x)$ satisfies an…
Let $p$ be a prime and ${\mathfrak P}_p$ the set of positive integers which are prime to $p$. Recently, Wang and Cai proved that for every positive integer $r$ and prime $p>2$ $$ \sum_{\substack{i+j+k=p^r\\ i,j,k\in{\mathfrak P}_p}}…
We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of semialgebraic sets given by Boolean formulas. The algorithm works in weak exponential time. This means that outside a…
The Bernoulli Factory is an algorithm that takes as input a series of i.i.d. Bernoulli random variables with an unknown but fixed success probability $p$, and outputs a corresponding series of Bernoulli random variables with success…
The \emph{Barnes $\zeta$-function} is \[ \zeta_n (z, x; \a) := \sum_{\m \in \Z_{\ge 0}^n} \frac{1}{\left(x + m_1 a_1 + \dots + m_n a_n \right)^z} \] defined for $\Re(x) > 0$ and $\Re(z) > n$ and continued meromorphically to $\C$.…
We analyze algorithms for computing the $n$th prime $p_n$ and establish asymptotic bounds for several approaches. Using existing results on the complexity of evaluating the prime-counting function $\pi(x)$, we show that the binary search…
An algorithm is presented that, taking a sequence of independent Bernoulli random variables with parameter $1/2$ as inputs and using only rational arithmetic, simulates a Bernoulli random variable with possibly irrational parameter $\tau$.…
The Brent-McMillan algorithm B3 (1980), when implemented with binary splitting, is the fastest known algorithm for high-precision computation of Euler's constant. However, no rigorous error bound for the algorithm has ever been published.…
A new method for continuing the usual Dirichlet series that defines the Riemann zeta function ${\zeta}(s)$ is presented. Numerical experiments demonstrating the computational efficacy of the resulting continuation are discussed.
A sharp asymptotic formula for the sum of reciprocals of $\pi(n)$ is derived, where $\pi(x)$ is the number of primes not exceeding $x$. This result improves the previous results of De Koninck--Ivi\'c and L. Panaitopol.
The integer complexity $f(n)$ of a positive integer $n$ is defined as the minimum number of 1's needed to represent $n$, using additions, multiplications and parentheses. We present two simple and faster algorithms for computing the integer…
We represent the Euler alternating series (sometimes called the "Dirichlet eta function"), and generally $(b^s-b)\zeta(s)/b^s$ for $b>1$ an integer, in the half-plane $\Re s>0$, via series dominated by geometric series, with arbitrarily…
An efficient algorithm for random sequential adsorption of hard discs in two dimensions is implemented. A precise value for the coverage is obtained: theta(infty) = 0.547069. The asymptotic law theta(t) = theta(infty) - ct^{-1/2} is…