Search Results for ""

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.

Let a_n and b_n be the perimeters of the circumscribed and inscribed n-gon and a_(2n) and b_(2n) the perimeters of the circumscribed and inscribed 2n-gon. Then a_(2n) = ...

For three consecutive orders of an orthonormal polynomial, the following relationship holds for n=2, 3, ...: p_n(x)=(A_nx+B_n)p_(n-1)(x)-C_np_(n-2)(x), (1) where A_n>0, B_n, ...

Let O and I be the circumcenter and incenter of a triangle with circumradius R and inradius r. Let d be the distance between O and I. Then d^2=R(R-2r) (Mackay 1886-1887; ...

Let phi(n) be any function, say analytic or integrable. Then int_0^inftyx^(s-1)sum_(k=0)^infty(-1)^kx^kphi(k)dx=(piphi(-s))/(sin(spi)) (1) and ...

where del is the backward difference.

The number of coincidences of a (nu,nu^') correspondence of value gamma on a curve of curve genus p is given by nu+nu^'+2pgamma.

For R[nu]>-1/2, J_nu(z)=(z/2)^nu2/(sqrt(pi)Gamma(nu+1/2))int_0^(pi/2)cos(zcost)sin^(2nu)tdt, where J_nu(z) is a Bessel function of the first kind, and Gamma(z) is the gamma ...

(1) for p in [-1/2,1/2], where delta is the central difference and S_(2n+1) = 1/2(p+n; 2n+1) (2) S_(2n+2) = p/(2n+2)(p+n; 2n+1), (3) with (n; k) a binomial coefficient.

Let (a)_i and (b)_i be sequences of complex numbers such that b_j!=b_k for j!=k, and let the lower triangular matrices F=(f)_(nk) and G=(g)_(nk) be defined as ...