Search Results for ""

An integer n which is tested to see if it divides a given number.

The polyhedral formula generalized to a surface of genus g, V-E+F=chi(g) where V is the number of polyhedron vertices, E is the number of polyhedron edges, F is the number of ...

In random number computation, a seed is an initial number used as the starting point in a random number generating algorithm. In a dynamical system, a seed is a starting ...

The graph complement of a graph hole. Graph antiholes are called even if they have an even number of vertices and odd if they have an odd number of vertices (Chvátal). No odd ...

The class m, curve order n, number of ordinary double points delta, number of cusps kappa, number of inflection points (inflection points) iota, number of bitangents tau, and ...

The order of a finite field is the number of elements it contains.

The determination of the number of alternating permutations having elements {1,2,...,n}.

A shuffling algorithm used in a class of random number generators.

The symbol "-" which is used to denote a negative number or subtraction.

A busy beaver is an n-state, 2-color Turing machine which writes a maximum number Sigma(n) of 1s before halting (Rado 1962; Lin and Rado 1965; Shallit 1998). Alternatively, ...