Search Results for ""

The number of ways N(m,n) of finding a subrectangle with an m×n rectangle can be computed by counting the number of ways in which the upper right-hand corner can be selected ...

Also called "Ethiopian multiplication." To multiply two numbers a and b, write a_0=a and b_0=b in two columns. Under a_0, write |_a_0/2_|, where |_x_| is the floor function, ...

An algorithm for multiplying two 32-bit integers modulo a 32-bit constant without using any intermediates larger than 32 bits. It is also useful in certain types of random ...

There are three types of cubic lattices corresponding to three types of cubic close packing, as summarized in the following table. Now that the Kepler conjecture has been ...

A plane-filling arrangement of plane figures or its generalization to higher dimensions. Formally, a tiling is a collection of disjoint open sets, the closures of which cover ...

There are two definitions of the Fermat number. The less common is a number of the form 2^n+1 obtained by setting x=1 in a Fermat polynomial, the first few of which are 3, 5, ...

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...

A sphere is defined as the set of all points in three-dimensional Euclidean space R^3 that are located at a distance r (the "radius") from a given point (the "center"). Twice ...

A set in R^d is concave if it does not contain all the line segments connecting any pair of its points. If the set does contain all the line segments, it is called convex.

A spherical polyhedron is set of arcs on the surface of a sphere corresponding to the projections of the edges of a polyhedron. The images above illustrate the spherical ...