Search Results for ""

A Redheffer matrix is a square (0,1)-matrix with elements a_(ij) equal to 1 if j=1 or i|j (i divides j), and 0 otherwise. For n=1, 2, ..., the first few Redheffer matrices ...

In the 1930s, Reidemeister first rigorously proved that knots exist which are distinct from the unknot. He did this by showing that all knot deformations can be reduced to a ...

A formula for the permanent of a matrix perm(a_(ij))=(-1)^nsum_(s subset= {1,...,n})(-1)^(|s|)product_(i=1)^nsum_(j in s)a_(ij), where the sum is over all subsets of ...

The sawtooth wave, called the "castle rim function" by Trott (2004, p. 228), is the periodic function given by S(x)=Afrac(x/T+phi), (1) where frac(x) is the fractional part ...

Searching refers to locating a given element or an element satisfying certain conditions from some (usually ordered or partially ordered) table, list, tree, etc.

A sorting algorithm which makes n passes over a set of n elements, in each pass selecting the smallest element and deleting it from the set. This algorithm has running time ...

The sequence 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, ... (OEIS A002024) consisting of 1 copy of 1, 2 copies of 2, 3 copies of 3, and so on. Surprisingly, there exist simple formulas ...

A polygon P is said to be simple (or a Jordan polygon) if the only points of the plane belonging to two polygon edges of P are the polygon vertices of P. Such a polygon has a ...

Sorting is the rearrangement of numbers (or other orderable objects) in a list into their correct lexographic order. Alphabetization is therefore a form of sorting. Because ...

Gardner showed how to dissect a square into eight and nine acute scalene triangles. W. Gosper discovered a dissection of a unit square into 10 acute isosceles triangles, ...