Search Results for ""

The idempotent numbers are given by B_(n,k)(1,2,3,...)=(n; k)k^(n-k), where B_(n,k) is a Bell polynomial and (n; k) is a binomial coefficient. A table of the first few is ...

The idiosyncratic polynomial is the bivariate graph polynomial defined as the characteristic polynomial in x of A+y(J-I-A), where A is the adjacency matrix, J is the unit ...

At the age of 17, Bernard Mares proposed the definite integral (Borwein and Bailey 2003, p. 26; Bailey et al. 2006) C_2 = int_0^inftycos(2x)product_(n=1)^(infty)cos(x/n)dx ...

Integration under the integral sign is the use of the identity int_a^bdxint_(alpha_0)^alphaf(x,alpha)dalpha=int_(alpha_0)^alphadalphaint_a^bf(x,alpha)dx (1) to compute an ...

The inverse erf function is the inverse function erfc^(-1)(z) of erfc(x) such that erfc(erfc^(-1)(x))=erfc^(-1)(erfc(x)), (1) with the first identity holding for 0<x<2 and ...

In determinant expansion by minors, the minimal number of transpositions of adjacent columns in a square matrix needed to turn the matrix representing a permutation of ...

The invertible matrix theorem is a theorem in linear algebra which gives a series of equivalent conditions for an n×n square matrix A to have an inverse. In particular, A is ...

The König-Egeváry theorem, sometimes simply called König's theorem, asserts that the matching number (i.e., size of a maximum independent edge set) is equal to the vertex ...

An approximation for the gamma function Gamma(z+1) with R[z]>0 is given by Gamma(z+1)=sqrt(2pi)(z+sigma+1/2)^(z+1/2)e^(-(z+sigma+1/2))sum_(k=0)^inftyg_kH_k(z), (1) where ...

Given a map f:S->T between sets S and T, the map g:T->S is called a left inverse to f provided that g degreesf=id_S, that is, composing f with g from the left gives the ...