Search Results for ""

An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...

alpha_n(z) = int_1^inftyt^ne^(-zt)dt (1) = n!z^(-(n+1))e^(-z)sum_(k=0)^(n)(z^k)/(k!). (2) It is equivalent to alpha_n(z)=E_(-n)(z), (3) where E_n(z) is the En-function.

A map F from R^n to R^n is area-preserving if m(F^(-1)(A))=m(A) for every subregion A of R^n, where m(A) is the n-dimensional measure of A. A linear transformation is ...

For a simple continued fraction x=[a_0,a_1,...] with convergents p_n/q_n, the fundamental recurrence relation is given by p_nq_(n-1)-p_(n-1)q_n=(-1)^(n+1).

A delta sequence is a sequence of strongly peaked functions for which lim_(n->infty)int_(-infty)^inftydelta_n(x)f(x)dx=f(0) (1) so that in the limit as n->infty, the ...

The equations are x = ((lambda-lambda_0)(1+costheta))/(sqrt(2+pi)) (1) y = (2theta)/(sqrt(2+pi)), (2) where theta is the solution to theta+sintheta=(1+1/2pi)sinphi. (3) This ...

The Jacobi triple product is the beautiful identity product_(n=1)^infty(1-x^(2n))(1+x^(2n-1)z^2)(1+(x^(2n-1))/(z^2))=sum_(m=-infty)^inftyx^(m^2)z^(2m). (1) In terms of the ...

The system of partial differential equations del ^2s-(|a|^2+1)s = 0 (1) del ^2a-del (del ·a)-s^2a = a. (2)

A sequence of n 0s and 1s is called an odd sequence if each of the n sums sum_(i=1)^(n-k)a_ia_(i+k) for k=0, 1, ..., n-1 is odd.

F(x,s) = sum_(m=1)^(infty)(e^(2piimx))/(m^s) (1) = psi_s(e^(2piix)), (2) where psi_s(x) is the polygamma function.