Search Results for ""

where R[mu+nu-lambda+1]>0, R[lambda]>-1, 0<a<b, J_nu(x) is a Bessel function of the first kind, Gamma(x) is the gamma function, and _2F_1(a,b;c;x) is a hypergeometric ...

For R[mu+nu]>0, |argp|<pi/4, and a>0, where J_nu(z) is a Bessel function of the first kind, Gamma(z) is the gamma function, and _1F_1(a;b;z) is a confluent hypergeometric ...

For a positive integer n, (2pi)^((n-1)/2)n^(1/2-nz)Gamma(nz)=product_(k=0)^(n-1)Gamma(z+k/n),

This is sometimes knows as the "bars and stars" method. Suppose a recipe called for 5 pinches of spice, out of 9 spices. Each possibility is an arrangement of 5 spices ...

A root-finding algorithm which makes use of a third-order Taylor series f(x)=f(x_n)+f^'(x_n)(x-x_n)+1/2f^('')(x_n)(x-x_n)^2+.... (1) A root of f(x) satisfies f(x)=0, so 0 ...

Gamma functions of argument 2z can be expressed in terms of gamma functions of smaller arguments. From the definition of the beta function, ...

The curvature of a surface satisfies kappa=kappa_1cos^2theta+kappa_2sin^2theta, where kappa is the normal curvature in a direction making an angle theta with the first ...

Expresses a function in terms of its Radon transform, f(x,y) = R^(-1)(Rf)(x,y) (1) = ...

dN^^+kappa_idr=0, where N^^ is the unit normal vector and kappa_i is one of the two principal curvatures.

The recurrence relation E_n=E_2E_(n-1)+E_3E_(n-2)+...+E_(n-1)E_2 which gives the solution to Euler's polygon division problem.