Search Results for ""

The converse of Pascal's theorem, which states that if the three pairs of opposite sides of (an irregular) hexagon meet at three collinear points, then the six vertices lie ...

Brent's method is a root-finding algorithm which combines root bracketing, bisection, and inverse quadratic interpolation. It is sometimes known as the van ...

The variety which is an invariant of degree four and is given by the equation y_0^4-y_0(y_1^3+y_2^3+y_3^3+y_4^3)+3y_1y_2y_3y_4=0.

The Burridge-Knopoff model is a system of differential equations used to model earthquakes using n points on a straight line, each of mass m, that interact with each other ...

A CW-complex is a homotopy-theoretic generalization of the notion of a simplicial complex. A CW-complex is any space X which can be built by starting off with a discrete ...

A fractal-like structure is produced for x<0 by superposing plots of Carotid-Kundalini functions ck_n of different orders n. the region -1<x<0 is called fractal land by ...

The term "Cartesian" is used to refer to anything that derives from René Descartes' conception of geometry (1637), which is based on the representation of points in the plane ...

Inscribe a triangle in a circle such that the sides of the triangle pass through three given points A, B, and C.

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.

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