Search Results for ""

A game in which each player has a finite number of moves and a finite number of choices at each move.

B_(p+k)=B_k+B_(k+1) (mod p), when p is prime and B_n is a Bell number.

An integer used to generate a digitaddition. A number can have more than one generator. If a number has no generator, it is called a self number.

In any tree, the number of dissimilar points minus the number of dissimilar lines plus the number of symmetry lines equals 1.

A dozen dozen, or the square number 144.

Let omega be the cube root of unity (-1+isqrt(3))/2. Then the Eisenstein primes are Eisenstein integers, i.e., numbers of the form a+bomega for a and b integers, such that ...

Schubert's application of the conservation of number principle.

An unknot which can only be unknotted by first increasing the number of crossings.

The co-rank of a graph G is defined as s(G)=m-n+c, where m is the number of edges of G, n is the number of vertices, and c is the number of connected components (Biggs 1993, ...

The number of nodes in a graph is called its order.