Search Results for ""

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

For elliptic curves over the rationals Q, the group of rational points is always finitely generated (i.e., there always exists a finite set of group generators). This theorem ...

The q-analog of the binomial theorem (1-z)^n=1-nz+(n(n-1))/(1·2)z^2-(n(n-1)(n-2))/(1·2·3)z^3+... (1) is given by (1-z/(q^n))(1-z/(q^(n-1)))...(1-z/q) ...

Suppose a,b in N, n=ab+1, and x_1, ..., x_n is a sequence of n real numbers. Then this sequence contains a monotonic increasing (decreasing) subsequence of a+1 terms or a ...

A theorem that classifies planar regular closed curves up to regular homotopy by their contour winding numbers (Whitney 1937). In his thesis, S. Smale generalized this result ...

If a points A^', B^', and C^' are marked on each side of a triangle DeltaABC, one on each side (or on a side's extension), then the three Miquel circles (each through a ...

The only whole number solution to the Diophantine equation y^3=x^2+2 is y=3, x=+/-5. This theorem was offered as a problem by Fermat, who suppressed his own proof.

The graph complement of a perfect graph is itself perfect. Originally known as the weak perfect graph conjecture (Fulkerson 1971), the result was subsequently proved by ...