Search Results for ""

The nth subfactorial (also called the derangement number; Goulden and Jackson 1983, p. 48; Graham et al. 2003, p. 1050) is the number of permutations of n objects in which no ...

A Taylor series is a series expansion of a function about a point. A one-dimensional Taylor series is an expansion of a real function f(x) about a point x=a is given by (1) ...

A trinomial coefficient is a coefficient of the trinomial triangle. Following the notation of Andrews (1990), the trinomial coefficient (n; k)_2, with n>=0 and -n<=k<=n, is ...

The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...

A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...

A triangle is a 3-sided polygon sometimes (but not very commonly) called the trigon. Every triangle has three sides and three angles, some of which may be the same. The sides ...

Apéry's numbers are defined by A_n = sum_(k=0)^(n)(n; k)^2(n+k; k)^2 (1) = sum_(k=0)^(n)([(n+k)!]^2)/((k!)^4[(n-k)!]^2) (2) = _4F_3(-n,-n,n+1,n+1;1,1,1;1), (3) where (n; k) ...

Find the shape of the curve down which a bead sliding from rest and accelerated by gravity will slip (without friction) from one point to another in the least time. The term ...

The conjecture made by Belgian mathematician Eugène Charles Catalan in 1844 that 8 and 9 (2^3 and 3^2) are the only consecutive powers (excluding 0 and 1). In other words, ...

Chebyshev iteration is a method for solving nonsymmetric problems (Golub and van Loan 1996, §10.1.5; Varga, 1962, Ch. 5). Chebyshev iteration avoids the computation of inner ...