Search Results for ""

e^(izcostheta)=sum_(n=-infty)^inftyi^nJ_n(z)e^(intheta), where J_n(z) is a Bessel function of the first kind. The identity can also be written ...

A generalization of the product rule for expressing arbitrary-order derivatives of products of functions, where (n; k) is a binomial coefficient. This can also be written ...

Pick a point O in the interior of a quadrilateral which is not a parallelogram. Join this point to each of the four vertices, then the locus of points O for which the sum of ...

Two curves phi and psi satisfying phi+psi=0 are said to be linearly dependent. Similarly, n curves phi_i, i=1, ..., n are said to be linearly dependent if sum_(i=1)^nphi_i=0.

The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...

The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

A collection of moves together with a corresponding set of weights which are followed probabilistically in the playing of a game. The minimax theorem of game theory states ...

Let pi_n(x)=product_(k=0)^n(x-x_k), (1) then f(x)=f_0+sum_(k=1)^npi_(k-1)(x)[x_0,x_1,...,x_k]+R_n, (2) where [x_1,...] is a divided difference, and the remainder is ...

Given a matrix equation Ax=b, the normal equation is that which minimizes the sum of the square differences between the left and right sides: A^(T)Ax=A^(T)b. It is called a ...