Search Results for ""

The usual number of scalar operations (i.e., the total number of additions and multiplications) required to perform n×n matrix multiplication is M(n)=2n^3-n^2 (1) (i.e., n^3 ...

Formulas obtained from differentiating Newton's forward difference formula, where R_n^'=h^nf^((n+1))(xi)d/(dp)(p; n+1)+h^(n+1)(p; n+1)d/(dx)f^((n+1))(xi), (n; k) is a ...

Kummer's first formula is (1) where _2F_1(a,b;c;z) is the hypergeometric function with m!=-1/2, -1, -3/2, ..., and Gamma(z) is the gamma function. The identity can be written ...

There exist a variety of formulas for either producing the nth prime as a function of n or taking on only prime values. However, all such formulas require either extremely ...

There are many formulas of pi of many types. Among others, these include series, products, geometric constructions, limits, special values, and pi iterations. pi is ...

For n a positive integer, expressions of the form sin(nx), cos(nx), and tan(nx) can be expressed in terms of sinx and cosx only using the Euler formula and binomial theorem. ...

Binet's first formula for the log gamma function lnGamma(z), where Gamma(z) is a gamma function, is given by for R[z]>0 (Erdélyi et al. 1981, p. 21; Whittaker and Watson ...

The Euler-Maclaurin integration and sums formulas can be derived from Darboux's formula by substituting the Bernoulli polynomial B_n(t) in for the function phi(t). ...

The Prosthaphaeresis formulas, also known as Simpson's formulas, are trigonometry formulas that convert a product of functions into a sum or difference. They are given by ...

The formulas j_n(z) = z^n(-1/zd/(dz))^n(sinz)/z (1) y_n(z) = -z^n(-1/zd/(dz))^n(cosz)/z (2) for n=0, 1, 2, ..., where j_n(z) is a spherical Bessel function of the first kind ...