Search Results for ""

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

A labeled binary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2 and 3, branches from these leading to 4, 5 and 6, 7, respectively, and so ...

The cylinder function is defined as C(x,y)={1 for sqrt(x^2+y^2)<=a; 0 for sqrt(x^2+y^2)>a. (1) The Bessel functions are sometimes also called cylinder functions. To find the ...

A set is denumerable iff it is equipollent to the finite ordinal numbers. (Moore 1982, p. 6; Rubin 1967, p. 107; Suppes 1972, pp. 151-152). However, Ciesielski (1997, p. 64) ...

Efron's dice are set of four nontransitive dice such that the probabilities of A winning against B, B against C, C against D, and D against A are all the same. The images ...

The sequence generated by the Levine-O'Sullivan greedy algorithm: 1, 2, 4, 6, 9, 12, 15, 18, 21, 24, 28, 32, 36, 40, 45, 50, 55, 60, 65, ... (OEIS A014011). The reciprocal ...

The distance between two skew lines with equations x = x_1+(x_2-x_1)s (1) x = x_3+(x_4-x_3)t (2) is given by D=(|(x_3-x_1)·[(x_2-x_1)x(x_4-x_3)]|)/(|(x_2-x_1)x(x_4-x_3)|) (3) ...

The pseudosmarandache function Z(n) is the smallest integer such that sum_(k=1)^(Z(n))k=1/2Z(n)[Z(n)+1] is divisible by n. The values for n=1, 2, ... are 1, 3, 2, 7, 4, 3, 6, ...

|_n]!={n! for n>=0; ((-1)^(-n-1))/((-n-1)!) for n<0. (1) The Roman factorial arises in the definition of the harmonic logarithm and Roman coefficient. It obeys the identities ...

The orthogonal polynomials defined variously by (1) (Koekoek and Swarttouw 1998, p. 24) or p_n(x;a,b,c,d) = W_n(-x^2;a,b,c,d) (2) = (3) (Koepf, p. 116, 1998). The first few ...