Search Results for ""

f(x) approx t_n(x)=sum_(k=0)^(2n)f_kzeta_k(x), where t_n(x) is a trigonometric polynomial of degree n such that t_n(x_k)=f_k for k=0, ..., 2n, and ...

J_n(z) = 1/(2pi)int_(-pi)^pie^(izcost)e^(in(t-pi/2))dt (1) = (i^(-n))/piint_0^pie^(izcost)cos(nt)dt (2) = 1/piint_0^picos(zsint-nt)dt (3) for n=0, 1, 2, ..., where J_n(z) is ...

Let J_nu(z) be a Bessel function of the first kind, N_nu(z) a Bessel function of the second kind, and j_(nu,n)(z) the zeros of z^(-nu)J_nu(z) in order of ascending real part. ...

The recurrence relation (n-1)A_(n+1)=(n^2-1)A_n+(n+1)A_(n-1)+4(-1)^n valid for n=4, 5, ... with A(2)=0 and A(3)=1 and which solves the married couples problem (Dörrie 1965, ...

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