Search Results for ""

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, ...

Analytic representations the symmetric triangle wave with period 2 and varying between -1 and 1 include f(x) = 2/pisin^(-1)[sin(pix)] (1) = 1-2|1-[2(1/2x+1/4 (mod 1))]| (2) = ...

Trigonometric functions of npi/9 radians for n an integer not divisible by 3 (e.g., 40 degrees and 80 degrees) cannot be expressed in terms of sums, products, and finite root ...

A Trott constant is a real number whose decimal digits are equal to the terms of its continued fraction. The first Trott constant (OEIS A039662) was discovered by M. Trott in ...

The bandwidth of a matrix M=(m_(ij)) is the maximum value of |i-j| such that m_(ij) is nonzero.

A bilinear basis is a basis, which satisfies the conditions (ax+by)·z=a(x·z)+b(y·z) z·(ax+by)=a(z·x)+b(z·y).