Search Results for ""

A theorem that can be stated either in the language of abstract algebraic curves or transcendental extensions. For an abstract algebraic curve, if x and y are nonconstant ...

The principal theorem of axonometry, first published without proof by Pohlke in 1860. It states that three segments of arbitrary length a^'x^', a^'y^', and a^'z^' which are ...

If A is a class of recursively enumerable sets, then the set of Gödel numbers of functions whose domains belong to A is called its index set. If the index set of A is a ...

A metatheorem stating that every theorem on partially ordered sets remains true if all inequalities are reversed. In this operation, supremum must be replaced by infimum, ...

Tutte's wheel theorem states that every polyhedral graph can be derived from a wheel graph via repeated graph contraction and edge splitting. For example, the figure above ...

A reciprocity theorem for the case n=3 solved by Gauss using "integers" of the form a+brho, when rho is a root of x^2+x+1=0 (i.e., rho equals -(-1)^(1/3) or (-1)^(2/3)) and ...

For a cyclic quadrilateral, the sum of the products of the two pairs of opposite sides equals the product of the diagonals AB×CD+BC×DA=AC×BD (1) (Kimberling 1998, p. 223). ...

A theorem about (or providing an equivalent definition of) compact sets, originally due to Georg Cantor. Given a decreasing sequence of bounded nonempty closed sets C_1 ...

Frucht's theorem states that every finite group is the automorphism group of a finite undirected graph. This was conjectured by König (1936) and proved by Frucht (1939). In ...

Define E(x;q,a)=psi(x;q,a)-x/(phi(q)), (1) where psi(x;q,a)=sum_(n<=x; n=a (mod q))Lambda(n) (2) (Davenport 1980, p. 121), Lambda(n) is the Mangoldt function, and phi(q) is ...