Search Results for ""

Roman (1984, p. 26) defines "the" binomial identity as the equation p_n(x+y)=sum_(k=0)^n(n; k)p_k(y)p_(n-k)(x). (1) Iff the sequence p_n(x) satisfies this identity for all y ...

(x^2+axy+by^2)(t^2+atu+bu^2)=r^2+ars+bs^2, (1) where r = xt-byu (2) s = yt+xu+ayu. (3)

For a smooth harmonic map u:M->N, where del is the gradient, Ric is the Ricci curvature tensor, and Riem is the Riemann tensor.

Let beta=detB=x^2-ty^2, (1) where B is the Brahmagupta matrix, then det[B(x_1,y_1) B(x_2,y_2)] = det[B(x_1,y_1)]det[B(x_2,y_2)] (2) = beta_1beta_2]. (3)

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 ...

sum_(k=-infty)^infty(a; m-k)(b; n-k)(a+b+k; k)=(a+n; m)(b+m; n).

If A is a normed algebra, a net {e_i} in A is called an approximate identity for A if sup_(i)|e_i|<infty and if for each a in A, e_ia->a and ae_i->a. Though this definition ...

A special case of the Artin L-function for the polynomial x^2+1. It is given by L(s)=product_(p odd prime)1/(1-chi^-(p)p^(-s)), (1) where chi^-(p) = {1 for p=1 (mod 4); -1 ...

For p an odd prime and a positive integer a which is not a multiple of p, a^((p-1)/2)=(a/p) (mod p), where (a|p) is the Legendre symbol.

x^n=sum_(k=0)^n<n; k>(x+k; n), where <n; k> is an Eulerian number and (n; k) is a binomial coefficient (Worpitzky 1883; Comtet 1974, p. 242).