Related papers: An efficient algorithm for the computation of Bern…

All the known approximations of the number of primes pi(n) not exceeding any given integer n are derived from real-valued functions that are asymptotic to pi(x), such as x/log x, Li(x) and Riemann's function R(x). The degree of…

We give an instant evaluation of multiple Zeta function at non-positive integers by elementary methods and discuss the Fourier theory (on unit interval) of the product of Bernoulli polynomials.We also show that the polynomial expression for…

We conjecture that the structure of Bernoulli numbers can be explicitly given in the closed form $$ B_n = (-1)^{\frac{n}{2}-1} \prod_{p-1 \nmid n} |n|_p^{-1} \prod\limits_{(p,l)\in\Psi^{\rm irr}_1 \atop n \equiv l \mods{p-1}} |p…

Let $\Psi(x,y)$ count the number of positive integers $n\le x$ such that every prime divisor of $n$ is at most $y$. Given inputs $x$ and $y$, what is the best way to estimate $\Psi(x,y)$? We address this problem in three ways: with a new…

Throughout more than two millennia many formulas have been obtained, some of them beautiful, to calculate the number pi. Among them, we can find series, infinite products, expansions as continued fractions and expansions using radicals.…

We provide direct elementary proofs of several explicit expressions for Bernoulli numbers and Bernoulli polynomials. As a byproduct of our method of proof, we provide natural definitions for generalized Bernoulli numbers and polynomials of…

In this article we obtain an explicit formula in terms of the partitions of the positive integer $n$ to express the $n$-th term of a wide class of sequences of numbers defined by recursion. Our proof is based only on arithmetics. We compare…

The computation and inversion of the binomial and negative binomial cumulative distribution functions play a key role in many applications. In this paper, we explain how methods used for the central beta distribution function (described in…

Hiary [3] has presented an algorithm which allows to evaluate the truncated theta function $\sum_{k=0}^n \exp(2\pi \i (zk+\tau k^2))$ to within $\pm \epsilon$ in $O(\ln(\tfrac{n}{\epsilon})^{\kappa})$ arithmetic operations for any real $z$…

Leonhard Euler likely developed his summation formula in 1732, and soon used it to estimate the sum of the reciprocal squares to 14 digits --- a value mathematicians had been competing to determine since Leibniz's astonishing discovery that…

A family of original formulae for computing number PI and its proof are presented. An algorithm is proposed to validate the results of this new algorithm.

The best known algorithm to compute the Jacobi symbol of two n-bit integers runs in time O(M(n) log n), using Sch\"onhage's fast continued fraction algorithm combined with an identity due to Gauss. We give a different O(M(n) log n)…

We consider methods for finding high-precision approximations to simple zeros of smooth functions. As an application, we give fast methods for evaluating the elementary functions log(x), exp(x), sin(x) etc. to high precision. For example,…

Let $P(z)$ be a polynomial of degree $n\geq 1$. In this paper we define an operator $B$, as following, $$B[P(z)]:=\lambda_0 P(z)+\lambda_1 (\frac{nz}{2}) \frac{P'(z)}{1!}+\lambda_2 (\frac{nz}{2})^2 \frac{P''(z)}{2!},$$ where…

Let $S(t) \;:=\; \frac{\displaystyle 1}{\displaystyle \pi}\arg \zeta(\frac{1}{2} + it)$. We prove that, for $T^{\,27/82+\varepsilon} \le H \le T$, we have $$ {\rm mes}\Bigl\{t\in [T, T+H]\;:\; S(t)>0\Bigr\} = \frac{H}{2} +…

Maximon has recently given an excellent summary of the properties of the Euler dilogarithm function and the frequently used generalizations of the dilogarithm, the most important among them being the polylogarithm function $Li_(z)$. The…

We present new algorithms for computing zeta functions of algebraic varieties over finite fields. In particular, let X be an arithmetic scheme (scheme of finite type over Z), and for a prime p let zeta_{X_p}(s) be the local factor of its…

In this paper we discuss a method to express the Prime counting function as a "sum" over Non-trivial zeros of Riemann Zeta function, using techniques from Analytic Number Theory, also we apply our results to the sum over primes of any…

Topological data analysis has emerged as a powerful tool for analyzing large-scale data. An abstract simplicial complex, in principle, can be built from data points, and by using tools from homology, topological features could be…

The well-know needle experiment of Buffon can be regarded as an analog (i.e., continuous) device that stochastically "computes" the number 2/pi ~ 0.63661, which is the experiment's probability of success. Generalizing the experiment and…