Search Results for ""

The Kepler-Poinsot polyhedra are four regular polyhedra which, unlike the Platonic solids, contain intersecting facial planes. In addition, two of the four Kepler-Poinsot ...

A magic cube is an n×n×n version of a magic square in which the n^2 rows, n^2 columns, n^2 pillars, and four space diagonals each sum to a single number M_3(n) known as the ...

A magic hexagon of order n is an arrangement of close-packed hexagons containing the numbers 1, 2, ..., H_(n-1), where H_n is the nth hex number such that the numbers along ...

Also called the ménage problem. In how many ways can n married couples be seated around a circular table in such a manner than there is always one man between two women and ...

A partition is a way of writing an integer n as a sum of positive integers where the order of the addends is not significant, possibly subject to one or more additional ...

Q(n), also denoted q(n) (Abramowitz and Stegun 1972, p. 825), gives the number of ways of writing the integer n as a sum of positive integers without regard to order with the ...

A game played on a board of a given shape consisting of a number of holes of which all but one are initially filled with pegs. The goal is to remove all pegs but one by ...

A permutation, also called an "arrangement number" or "order," is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. The ...

A permutation cycle is a subset of a permutation whose elements trade places with one another. Permutations cycles are called "orbits" by Comtet (1974, p. 256). For example, ...

The permutation symbol (Evett 1966; Goldstein 1980, p. 172; Aris 1989, p. 16) is a three-index object sometimes called the Levi-Civita symbol (Weinberg 1972, p. 38; Misner et ...