Search Results for ""

The BBP (named after Bailey-Borwein-Plouffe) is a formula for calculating pi discovered by Simon Plouffe in 1995, ...

An algorithm originally described by Barnsley in 1988. Pick a point at random inside a regular n-gon. Then draw the next point a fraction r of the distance between it and a ...

Define S_n(x) = sum_(k=1)^(infty)(sin(kx))/(k^n) (1) C_n(x) = sum_(k=1)^(infty)(cos(kx))/(k^n), (2) then the Clausen functions are defined by ...

Clausen's integral, sometimes called the log sine integral (Borwein and Bailey 2003, p. 88) is the n=2 case of the S_2 Clausen function Cl_2(theta) = ...

Instead of picking two points from the interior of the cube, instead pick two points on different faces of the unit cube. In this case, the average distance between the ...

An extension of two-valued logic such that statements need not be true or false, but may have a degree of truth between 0 and 1. Such a system can be extremely useful in ...

The constant e^pi that Gelfond's theorem established to be transcendental seems to lack a generally accepted name. As a result, in this work, it will be dubbed Gelfond's ...

Gelfond's theorem, also called the Gelfond-Schneider theorem, states that a^b is transcendental if 1. a is algebraic !=0,1 and 2. b is algebraic and irrational. This provides ...

The Gregory series is a pi formula found by Gregory and Leibniz and obtained by plugging x=1 into the Leibniz series, pi/4=sum_(k=1)^infty((-1)^(k+1))/(2k-1)=1-1/3+1/5-... ...

Given a 111×111 (0,1)-matrix, fill 11 spaces in each row in such a way that all columns also have 11 spaces filled. Furthermore, each pair of rows must have exactly one ...