Related papers: A probabilistic proof of Wallis's formula for pi
We use well-known limit theorems in probability theory to derive a Wallis-type product formula for the gamma function. Our result immediately provides a probabilistic proof of Wallis's product formula for $\pi$, as well as the duplication…
The present note generalizes a well-known formula for pi/2 named after the English mathematician John Wallis. The two new formulas for infinite products containing the natural numbers and their roots express them using the Euler-Mascheroni…
In this note we show that any proof of Wallis's formula or of the probability integral formula proves both assertions.
In 1655, John Wallis whilst at the University of Oxford discovered the famous and beautiful formula for pi, now known as Wallis' Product. Since then, several analogous formulae have been discovered generalising the original. One more modern…
In this Note, we start off with the primary representation of e and from there present an elementary short proof for the Wallis formula for $\pi$.
The Stirling approximation formula for $n!$ dates from 1730. Here we give new and instructive proofs of this and related approximation formulae via tools of probability and statistics. There are connections to the Central Limit Theorem and…
One of the earliest examples of analytic representations for $\pi$ is given by an infinite product provided by Wallis in 1655. The modern literature often presents this evaluation based on the integral formula $$ \frac{2}{\pi} \int_0^\infty…
We generalize Wallis's 1655 infinite product for $\pi/2$ to one for $(\pi/K)\csc(\pi/K)$, as well as give new Wallis-type products for $\pi/4, 2, \sqrt{2+\sqrt2}, 2\pi/3\sqrt3,$ and other constants. The proofs use a classical infinite…
From a global series for the alternating zeta function, we derive an infinite product for pi that resembles the product for $e^\gamma$ ($\gamma$ is Euler's constant) in math.CA/0306008. (An alternate derivation accelerates Wallis's product…
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.
We collect well known and less known facts about the bivariate normal distribution and translate them into copula language. In addition, we prove a very general formula for the bivariate normal copula, we compute Gini's gamma, and we…
We produce formulas for $$\sum_{j=1}^{2^{n-2}}\frac{1}{\sin^s\left(\frac{(2j-1)\pi}{2^n}\right)}$$ in terms of Generalized Bernoulli and Euler polynomials and use one of the formulas to produce a nice integral representation of the Riemann…
We study the series s(n,x) which is the sum for k from 1 to n of the square of the sine of the product x Gamma(k)/k, where x is a variable. By Wilson's theorem we show that the integer part of s(n,x) for x = Pi/2 is the number of primes…
Our main result shows that for every odd natural number n > 1 there is a partition of the rational numbers, x/2n in lowest terms, in the unit interval, the product of whose Gamma values takes the form of powers of 2 and pi.
Stirling's formula is a powerful asymptotic approximation of the factorial function. Many well-known proofs of this formula are grounded in integral calculus. In this paper, we present an alternative proof of Stirling's formula using only…
We obtained a new formula for $\pi$.
In previous papers we introduced a class of polynomials which follow the same recursive formula as the Lucas-Lehmer numbers, studying the distribution of their zeros and remarking that this distribution follows a sequence related to the…
We use a variant of Wan's method to prove two Ramanujan-Orr type formulas for $1/\pi$. This variant needs to know in advance the formulas for $1/\pi$ that we want to prove, but avoids the need of solving a system of equations.
In this paper we initiate the study of products and sums divisible by central binomial coefficients. We show that 2(2n+1)binom(2n,n)| binom(6n,3n)binom(3n,n) for every n=1,2,3,... Also, for any nonnegative integers $k$ and $n$ we have…
Let p(n) denote the number of unrestricted partitions of n. For i=0, 2, let p[i](n) denote the number of partitions pi of n such that O(pi) - O(pi') = i mod 4. Here O(pi) denotes the number of odd parts of the partition pi and pi' is the…