Search Results for ""

Consider a convex pentagon and extend the sides to a pentagram. Externally to the pentagon, there are five triangles. Construct the five circumcircles. Each pair of adjacent ...

A very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their "order." The most common ...

If J is a simple closed curve in R^2, then the Jordan curve theorem, also called the Jordan-Brouwer theorem (Spanier 1966) states that R^2-J has two components (an "inside" ...

In analysis, the phrase "Riesz-Fischer theorem" is used to describe a number of results concerning the convergence of Cauchy sequences in L-p spaces. The theorem is named for ...

The strongly embedded theorem identifies all simple groups with a strongly 2-embedded subgroup. In particular, it asserts that no simple group has a strongly 2-embedded ...

If p is a prime number and a is a natural number, then a^p=a (mod p). (1) Furthermore, if pa (p does not divide a), then there exists some smallest exponent d such that ...

The second, or diamond, group isomorphism theorem, states that if G is a group with A,B subset= G, and A subset= N_G(B), then (A intersection B)⊴A and AB/B=A/A intersection ...

Let a chord of constant length be slid around a smooth, closed, convex curve C, and choose a point on the chord which divides it into segments of lengths p and q. This point ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. This partitions graphs into ...

Saalschütz's theorem is the generalized hypergeometric function identity _3F_2[a,b,-n; c,1+a+b-c-n;1]=((c-a)_n(c-b)_n)/((c)_n(c-a-b)_n) (1) which holds for n a nonnegative ...