Search Results for ""

The shortest circular sequence of length sigma^n such that every string of length n on the alphabet a of size sigma occurs as a contiguous subrange of the sequence described ...

The de Longchamps point L is the reflection of the orthocenter H about the circumcenter O of a triangle. It has triangle center function alpha=cosA-cosBcosC, (1) and is ...

A graph is k-edge-connected if there does not exist a set of k-1 edges whose removal disconnects the graph (Skiena 1990, p. 177). The maximum edge connectivity of a given ...

The first of the Hardy-Littlewood conjectures. The k-tuple conjecture states that the asymptotic number of prime constellations can be computed explicitly. In particular, ...

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p). An s-cluster is an isolated group of s adjacent (i.e., horizontally ...

The van Aubel line is the line in the plane of a reference triangle that connects the orthocenter H and symmedian point K, and symmedian point of the orthic triangle. The ...

Given an arbitrary planar quadrilateral, place a square outwardly on each side, and connect the centers of opposite squares. Then van Aubel's theorem states that the two ...

van der Waerden's theorem is a theorem about the existence of arithmetic progressions in sets. The theorem can be stated in four equivalent forms. 1. If N=C_1 union C_2 union ...

von Neumann-Bernays-Gödel set theory (abbreviated "NBG") is a version of set theory which was designed to give the same results as Zermelo-Fraenkel set theory, but in a more ...

The von Staudt-Clausen theorem, sometimes also known as the Staudt-Clausen theorem (Carlitz 1968), states that B_(2n)=A_n-sum_(p_k; (p_k-1)|2n)1/(p_k), (1) where B_(2n) is a ...