Search Results for ""

E. Pegg Jr. (pers. comm., Nov. 8, 2004) found an approximation to Apéry's constant zeta(3) given by zeta(3) approx 10+zeta(16)-sqrt(96), (1) which is good to 6 digits. M. ...

Successive application of Archimedes' recurrence formula gives the Archimedes algorithm, which can be used to provide successive approximations to pi (pi). The algorithm is ...

Let a_n and b_n be the perimeters of the circumscribed and inscribed n-gon and a_(2n) and b_(2n) the perimeters of the circumscribed and inscribed 2n-gon. Then a_(2n) = ...

A factorization of the form 2^(4n+2)+1=(2^(2n+1)-2^(n+1)+1)(2^(2n+1)+2^(n+1)+1). (1) The factorization for n=14 was discovered by Aurifeuille, and the general form was ...

Ball tetrahedron picking is the selection of quadruples of points (corresponding to vertices of a general tetrahedron) randomly placed inside a ball. n random tetrahedra can ...

The apodization function f(x)=1-(|x|)/a (1) which is a generalization of the one-argument triangle function. Its full width at half maximum is a. It has instrument function ...

A class of curve defined at integer values which hops from one value to another. Their name derives from the Greek word betaalphataurhoalphachiiotaomicronnu batrachion, which ...

A transformation formula for continued fractions (Lorentzen and Waadeland 1992) which can, for example, be used to prove identities such as ...

The "binary" Champernowne constant is obtained by concatenating the binary representations of the integers C_2 = 0.(1)(10)(11)(100)(101)(110)(111)..._2 (1) = ...

The binomial transform takes the sequence a_0, a_1, a_2, ... to the sequence b_0, b_1, b_2, ... via the transformation b_n=sum_(k=0)^n(-1)^(n-k)(n; k)a_k. The inverse ...