Search Results for ""

The problem of finding the number of different ways in which a product of n different ordered factors can be calculated by pairs (i.e., the number of binary bracketings of n ...

Catalan's triangle is the number triangle 1 ; 1 1 ; 1 2 2 ; 1 3 5 5 ; 1 4 9 14 14 ; 1 5 14 28 42 42 ; 1 6 20 48 90 132 132 (1) (OEIS A009766) with entries given by ...

A number of spellings of "Chebyshev" (which is the spelling used exclusively in this work) are commonly found in the literature. These include Tchebicheff, Čebyšev, ...

A problem asking for the shortest tour of a graph which visits each edge at least once (Kwan 1962; Skiena 1990, p. 194). For an Eulerian graph, an Eulerian cycle is the ...

The circumcircle mid-arc triangle is the triangle whose vertices are given by the circumcircle mid-arc points of a given reference triangle. Its trilinear vertex matrix is ...

Clark's triangle is a number triangle created by setting the vertex equal to 0, filling one diagonal with 1s, the other diagonal with multiples of an integer f, and filling ...

The coheight of a proper ideal I of a commutative Noetherian unit ring R is the Krull dimension of the quotient ring R/I. The coheight is related to the height of I by the ...

The expected number of trials needed to collect a complete set of n different objects when picked at random with repetition is nH_n (Havil 2003, p. 131). For n=1, 2, ..., the ...

A connection game is a board game in which players compete to develop or complete a type of topological connection with their pieces. This could involve forming a path ...

Let p be a prime with n digits and let A be a constant. Call p an "A-prime" if the concatenation of the first n digits of A (ignoring the decimal point if one is present) ...