Search Results for ""

The theory of classifying problems based on how difficult they are to solve. A problem is assigned to the P-problem (polynomial-time) class if the number of steps needed to ...

Napier's bones, also called Napier's rods, are numbered rods which can be used to perform multiplication of any number by a number 2-9. By placing "bones" corresponding to ...

Triangulation is the division of a surface or plane polygon into a set of triangles, usually with the restriction that each triangle side is entirely shared by two adjacent ...

A finite group G has a finite number of conjugacy classes and a finite number of distinct irreducible representations. The group character of a group representation is ...

Sylvester's line problem, known as the Sylvester-Gallai theorem in proved form, states that it is not possible to arrange a finite number of points so that a line through ...

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

As proposed by Hosoya (1971), the Hosoya index (also called Z-index) of a graph is defined by Z = sum_(k=0)^(n)|a_k| (1) = sum_(k=0)^(n)b_k, (2) where n is the number of ...

The Wiener index W, denoted w (Wiener 1947) and also known as the "path number" or Wiener number (Plavšić et al. 1993), is a graph index defined for a graph on n nodes by ...

A (v,g)-cage graph is a v-regular graph of girth g having the minimum possible number of nodes. When v is not explicitly stated, the term "g-cage" generally refers to a ...

The Jacobi symbol (a/y)=chi(y) as a number theoretic character can be extended to the Kronecker symbol (f(a)/y)=chi^*(y) so that chi^*(y)=chi(y) whenever chi(y)!=0. When y is ...