TOPICS
Search

Search Results for ""


341 - 350 of 576 for Biggest Little PolygonSearch Results
The ascending chain condition, commonly abbreviated "A.C.C.," for a partially ordered set X requires that all increasing sequences in X become eventually constant. A module M ...
The associahedron is the n-dimensional generalization of the pentagon. It was discovered by Stasheff in 1963 and it is also known as the Stasheff polytope. The number of ...
The algorithm for the construction of a Gröbner basis from an arbitrary ideal basis. Buchberger's algorithm relies on the concepts of S-polynomial and polynomial reduction ...
A function with k continuous derivatives is called a C^k function. In order to specify a C^k function on a domain X, the notation C^k(X) is used. The most common C^k space is ...
Let A and B be any sets with empty intersection, and let |X| denote the cardinal number of a set X. Then |A|+|B|=|A union B| (Ciesielski 1997, p. 68; Dauben 1990, p. 173; ...
Let {a_n} be a series of positive terms with a_(n+1)<=a_n. Then sum_(n=1)^(infty)a_n converges iff sum_(k=0)^infty2^ka_(2^k) converges.
The orthogonal polynomials defined by c_n^((mu))(x) = _2F_0(-n,-x;;-mu^(-1)) (1) = ((-1)^n)/(mu^n)(x-n+1)_n_1F_1(-n;x-n+1;mu), (2) where (x)_n is the Pochhammer symbol ...
A map projection which is a conformal mapping, i.e., one for which local (infinitesimal) angles on a sphere are mapped to the same angles in the projection. On maps of an ...
The coversine is a little-used entire trigonometric function defined by covers(z) = versin(1/2pi-z) (1) = 1-sinz, (2) where versin(z) is the versine and sinz is the sine. The ...
What is the area of the largest square that can be inscribed on a unit cube (Trott 2004, p. 104)? The answer is 9/8, given by a square with vertices (1/4, 0, 0), (0, 1, 1/4), ...
1 ... 32|33|34|35|36|37|38 ... 58 Previous Next

...