Search Results for ""

A modification of Legendre's formula for the prime counting function pi(x). It starts with |_x_| = (1) where |_x_| is the floor function, P_2(x,a) is the number of integers ...

Machin's formula is given by 1/4pi=4cot^(-1)5-cot^(-1)239. There are a whole class of Machin-like formulas with various numbers of terms (although only four such formulas ...

A formula for the permanent of a matrix perm(a_(ij))=(-1)^nsum_(s subset= {1,...,n})(-1)^(|s|)product_(i=1)^nsum_(j in s)a_(ij), where the sum is over all subsets of ...

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

The duplication formula for Rogers L-function follows from Abel's functional equation and is given by 1/2L(x^2)=L(x)-L(x/(1+x)).

The quartic formula is a name sometimes given to one of the related explicit formulas for the four roots z_1, ..., z_4 of an arbitrary quartic equation with real coefficients ...

Riddell's formula for unlabeled graphs is the Euler transform relating the number of unlabeled connected graphs on n nodes satisfying some property with the corresponding ...

Binet's formula is an equation which gives the nth Fibonacci number as a difference of positive and negative nth powers of the golden ratio phi. It can be written as F_n = ...

Taking the locus of midpoints from a fixed point to a circle of radius r results in a circle of radius r/2. This follows trivially from r(theta) = [-x; 0]+1/2([rcostheta; ...

Define the notation [n]f_0=f_(-(n-1)/2)+...+f_0+...+f_((n-1)/2) (1) and let delta be the central difference, so delta^2f_0=f_1-2f_0+f_(-1). (2) Spencer's 21-term moving ...