Search Results for ""

Scan the decimal expansion of a constant (including any digits to the left of the decimal point) until all n-digit strings have been seen (including 0-padded strings). The ...

The Chebyshev polynomials of the first kind are a set of orthogonal polynomials defined as the solutions to the Chebyshev differential equation and denoted T_n(x). They are ...

A mathematical procedure for finding the best-fitting curve to a given set of points by minimizing the sum of the squares of the offsets ("the residuals") of the points from ...

Multiply all the digits of a number n by each other, repeating with the product until a single digit is obtained. The number of steps required is known as the multiplicative ...

What is the maximum number of queens that can be placed on an n×n chessboard such that no two attack one another? The answer is n-1 queens for n=2 or n=3 and n queens ...

The rectilinear crossing number of a graph G is the minimum number of crossings in a straight line embedding of G in a plane. It is variously denoted rcr(G), cr^_(G) ...

A spanning tree of a graph on n vertices is a subset of n-1 edges that form a tree (Skiena 1990, p. 227). For example, the spanning trees of the cycle graph C_4, diamond ...

The Alexander polynomial is a knot invariant discovered in 1923 by J. W. Alexander (Alexander 1928). The Alexander polynomial remained the only known knot polynomial until ...

Apéry's constant is defined by zeta(3)=1.2020569..., (1) (OEIS A002117) where zeta(z) is the Riemann zeta function. B. Haible and T. Papanikolaou computed zeta(3) to 1000000 ...

A complete tripartite graph is the k=3 case of a complete k-partite graph. In other words, it is a tripartite graph (i.e., a set of graph vertices decomposed into three ...