Search Results for ""

The value for zeta(2)=sum_(k=1)^infty1/(k^2) (1) can be found using a number of different techniques (Apostol 1983, Choe 1987, Giesy 1972, Holme 1970, Kimble 1987, Knopp and ...

For a set of positive gamma_k, k=0, 1, 2..., Turán's inequalities are given by gamma_k^2-gamma_(k-1)gamma_(k+1)>=0 for k=1, 2, ....

A graph G having chromatic number chi(G)<=k is called a k-colorable graph (Harary 1994, p. 127). In contrast, a graph having chi(G)=k is said to be a k-chromatic graph. Note ...

Calabi's triangle is the unique triangle other that the equilateral triangle for which the largest inscribed square can be inscribed in three different ways (Calabi 1997). ...

If f(z) is meromorphic in a region R enclosed by a contour gamma, let N be the number of complex roots of f(z) in gamma, and P be the number of poles in gamma, with each zero ...

A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...

The alternating harmonic series is the series sum_(k=1)^infty((-1)^(k-1))/k=ln2, which is the special case eta(1) of the Dirichlet eta function eta(z) and also the x=1 case ...

The surface with parametric equations x = (sinhvcos(tauu))/(1+coshucoshv) (1) y = (sinhvsin(tauu))/(1+coshucoshv) (2) z = (coshvsinh(u))/(1+coshucoshv), (3) where tau is the ...

Two matrices A and B are said to be equal iff a_(ij)=b_(ij) (1) for all i,j. Therefore, [1 2; 3 4]=[1 2; 3 4], (2) while [1 2; 3 4]!=[0 2; 3 4]. (3)

Defined for samples x_i, i=1, ..., N by alpha_r=1/Nsum_(i=1)^Nz_i^r=(mu_r)/(sigma^r), (1) where z_i=(x_i-x^_)/(s_x). (2) The first few are alpha_1 = 0 (3) alpha_2 = 1 (4) ...