Search Results for ""

The 60 Pascal lines of a hexagon inscribed in a conic intersect three at a time through 20 Steiner points, and also three at a time in 60 Kirkman points. Each Steiner point ...

If the trilinear polars of the polygon vertices of a triangle are distinct from the respectively opposite sides, they meet the sides in three collinear points.

The chi distribution with n degrees of freedom is the distribution followed by the square root of a chi-squared random variable. For n=1, the chi distribution is a ...

A problem asking for the shortest tour of a graph which visits each edge at least once (Kwan 1962; Skiena 1990, p. 194). For an Eulerian graph, an Eulerian cycle is the ...

A triangle ABC formed by three circular arcs. By extending the arcs into complete circles, the points of intersection A^', B^', and C^' are obtained. This gives the three ...

If the four points making up a quadrilateral are joined pairwise by six distinct lines, a figure known as a complete quadrangle results. A complete quadrangle is therefore a ...

A statistical distribution for which the variables may take on a continuous range of values. Abramowitz and Stegun (1972, p. 930) give a table of the parameters of most ...

Let A_1, A_2, A_3, and A_4 be four points on a circle, and H_1, H_2, H_3, H_4 the orthocenters of triangles DeltaA_2A_3A_4, etc. If, from the eight points, four with ...

An E_8 polytope is a polytope having the symmetry of the exceptional simple Lie groups E_8 of dimension 248. There are 255 uniform polytopes with E_8 symmetry in 8 ...

An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...