Search Results for ""

The Knuth-Bendix completion algorithm attempts to transform a finite set of identities into a finitely terminating, confluent term rewriting system whose reductions preserve ...

The numbers defined by the recurrence relation K_(n+1)=1+min(2K_(|_n/2_|),3K_(|_n/3_|)), with K_0=1. The first few values for n=0, 1, 2, ... are 1, 3, 3, 4, 7, 7, 7, 9, 9, ...

For n>=1, let u and v be integers with u>v>0 such that the Euclidean algorithm applied to u and v requires exactly n division steps and such that u is as small as possible ...

The Petersen graph is the cubic graph on 10 vertices and 15 edges which is the unique (3,5)-cage graph (Harary 1994, p. 175), as well as the unique (3,5)-Moore graph. It can ...

The Pratt certificate is a primality certificate based on Fermat's little theorem converse. Prior to the work of Pratt (1975), the Lucas-Lehmer test had been regarded purely ...

A primefree sequence is sequence whose terms are never prime. Graham (1964) proved that there exist relatively prime positive integers a and b such that the recurrence ...

A rooted tree is a tree in which a special ("labeled") node is singled out. This node is called the "root" or (less commonly) "eve" of the tree. Rooted trees are equivalent ...

Finch (2001, 2003) defines a k-rough (or k-jagged) number to be positive integer all of whose prime factors are greater than or equal to k. Greene and Knuth define "unusual ...

The Sierpiński gasket graph of order n is the graph obtained from the connectivity of the Sierpiński sieve. The first few Sierpiński gasket graphs are illustrated above. S_2 ...

The nth-order Sierpiński tetrahedron graph is the connectivity graph of black triangles in the nth iteration of the tetrix fractal. The first three iterations are shown ...