Search Results for ""

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 T(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Define f_m(x)=product_(t in T(m))(x-t). (1) Then a ...

The Baum-Sweet sequence is the sequence of numbers {b_n} such that b_n=1 if the binary representation of n contains no block of consecutive 0s of odd length, and b_n=0 ...

An interpolation formula, sometimes known as the Newton-Bessel formula, given by (1) for p in [0,1], where delta is the central difference and B_(2n) = 1/2G_(2n) (2) = ...

The Bonne projection is a map projection that resembles the shape of a heart. Let phi_1 be the standard parallel, lambda_0 the central meridian, phi be the latitude, and ...

Polynomials s_k(x;lambda) which form a Sheffer sequence with g(t) = 1+e^(lambdat) (1) f(t) = e^t-1 (2) and have generating function ...

There are three types of boundary conditions commonly encountered in the solution of partial differential equations: 1. Dirichlet boundary conditions specify the value of the ...

In the theory of transfinite ordinal numbers, 1. Every well ordered set has a unique ordinal number, 2. Every segment of ordinals (i.e., any set of ordinals arranged in ...

For any system that seeks to minimize a function, only seven different local forms of catastrophe "typically" occur for four or fewer variables: 1. Fold catastrophe, 2. Cusp ...

An axiomatic system is said to be categorical if there is only one essentially distinct representation for it. In particular, the names and types of objects within the system ...