Search Results for ""

The correspondence which relates the Hanoi graph to the isomorphic graph of the odd binomial coefficients in Pascal's triangle, where the adjacencies are determined by ...

A collection of moves together with a corresponding set of weights which are followed probabilistically in the playing of a game. The minimax theorem of game theory states ...

The series which arises in the binomial theorem for negative integer -n, (x+a)^(-n) = sum_(k=0)^(infty)(-n; k)x^ka^(-n-k) (1) = sum_(k=0)^(infty)(-1)^k(n+k-1; k)x^ka^(-n-k) ...

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