Search Results for ""

The problem of determining how many nonattacking knights K(n) can be placed on an n×n chessboard. For n=8, the solution is 32 (illustrated above). In general, the solutions ...

The Kronecker-Weber theorem, sometimes known as the Kronecker-Weber-Hilbert theorem, is one of the earliest known results in class field theory. In layman's terms, the ...

A (general, asymmetric) lens is a lamina formed by the intersection of two offset disks of unequal radii such that the intersection is not empty, one disk does not completely ...

A Moiré pattern is an interference pattern produced by overlaying similar but slightly offset templates. A simple example is obtained by taking two identical ruled ...

A multiway system is a kind of substitution system in which multiple states are permitted at any stage. This accommodates rule systems in which there is more than one ...

A connective in logic which yields true if any one of a sequence conditions is true, and false if all conditions are false. In formal logic, the term disjunction (or, more ...

A number of attractive polyhedron compounds consisting of three octahedra. The first (left figues) is the polyhedron dual of the cube 3-compound. These compounds will be ...

The base 8 notational system for representing real numbers. The digits used are 0, 1, 2, 3, 4, 5, 6, and 7, so that 8_(10) (8 in base 10) is represented as 10_8 ...

A linkage with six rods which draws the inverse of a given curve. When a pencil is placed at P, the inverse is drawn at P^' (or vice versa). If a seventh rod (dashed) is ...

As first shown by Meyer and Ritchie (1967), do-loops (which have a fixed iteration limit) are a special case of while-loops. A function that can be implemented using only ...