TOPICS
Search

Search Results for ""


851 - 860 of 2395 for Burnside's theoremSearch Results
Let the residue from Pépin's theorem be R_n=3^((F_n-1)/2) (mod F_n), where F_n is a Fermat number. Selfridge and Hurwitz use R_n (mod 2^(35)-1,2^(36),2^(36)-1). A ...
The lines joining the vertices of a tetrahedron to the centroids of the opposite faces are called medians. Commandino's theorem states that the four medians of a tetrahedron ...
The figure formed when the midpoints of adjacent sides of a quadrilateral are joined. Varignon's theorem demonstrated that this figure is a parallelogram. The center of the ...
Martin Gardner (1975) played an April Fool's joke by asserting that the map of 110 regions illustrated above (left figure) required five colors and constitutes a ...
A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge ...
A statement about theorems. It usually gives a criterion for getting a new theorem from an old one, either by changing its objects according to a rule (duality principle), or ...
Let O and I be the circumcenter and incenter of a triangle with circumradius R and inradius r. Let d be the distance between O and I. Then d^2=R(R-2r) (Mackay 1886-1887; ...
The resolution principle, due to Robinson (1965), is a method of theorem proving that proceeds by constructing refutation proofs, i.e., proofs by contradiction. This method ...
A simple group is a group whose only normal subgroups are the trivial subgroup of order one and the improper subgroup consisting of the entire original group. Simple groups ...
A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...
1 ... 83|84|85|86|87|88|89 ... 240 Previous Next

...