Search Results for ""

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node ...

Brocard's problem asks to find the values of n for which n!+1 is a square number m^2, where n! is the factorial (Brocard 1876, 1885). The only known solutions are n=4, 5, and ...

The number M_2(n) = 1/nsum_(k=1)^(n^2)k (1) = 1/2n(n^2+1) (2) to which the n numbers in any horizontal, vertical, or main diagonal line must sum in a magic square. The first ...

The standard deviation sigma of a probability distribution is defined as the square root of the variance sigma^2, sigma = sqrt(<x^2>-<x>^2) (1) = sqrt(mu_2^'-mu^2), (2) where ...

The augmented sphenocorona is Johnson solid J_(87), which is formed from augmentation of one of the square faces of the sphenocorona by an equilateral square pyramid. The ...

The augmented triangular prism is Johnson solid J_(49), which is formed from augmentation of one of the lateral faces of an equilateral triangular prism by an equilateral ...

The augmented truncated tetrahedron is Johnson solid J_(66) constructed by affixing a square cupola to one of the octagonal faces of a truncated cube such that the cupola's ...

A fake knot (i.e., a knot equivalent to the unknot) created by tying a square knot, then looping one end twice through the knot such that when both ends are pulled, the knot ...

Clean tile is a game investigated by Buffon (1777) in which players bet on the number of different tiles a thrown coin will partially cover on a floor that is regularly ...