Search Results for ""

A finite, increasing sequence of integers {a_1,...,a_m} such that (a_i-1)|(a_1...a_(m-1)) for i=1, ..., m, where m|n indicates that m divides n. A Carmichael sequence has ...

Every finite group of order n can be represented as a permutation group on n letters, as first proved by Cayley in 1878 (Rotman 1995).

In 1976, Coates and Wiles showed that elliptic curves with complex multiplication having an infinite number of solutions have L-functions which are zero at the relevant fixed ...

Consecutive numbers (or more properly, consecutive integers) are integers n_1 and n_2 such that n_2-n_1=1, i.e., n_2 follows immediately after n_1. Given two consecutive ...

A partition p is said to contain another partition q if the Ferrers diagram of p contains the Ferrers diagram of q. For example, {3,3,2} (left figure) contains both {3,3,1} ...

A random polygon containing the origin (Kovalenko 1999).

The cubic groups are the point groups T_h and O_h together with their pure rotation subgroups T_d, T, and O (Cotton 1990, pp. 433-434).

A cylinder can be dissected into unequal squares, with nine squares required at a minimum. Trivial squarings can be constructed by taking rectangle dissections and matching ...

A theory is decidable iff there is an algorithm which can determine whether or not any sentence r is a member of the theory.

The desmic configuration is three-dimensional configuration of points consisting of three tetrads of points, each two of the tetrads of which are perspective from the four ...