Search Results for ""

A normalized form of the cumulative normal distribution function giving the probability that a variate assumes a value in the range [0,x], ...

The lines containing the three points of the intersection of the three pairs of opposite sides of a (not necessarily regular) hexagon. There are 6! (i.e., 6 factorial) ...

Inspired by computer simulations of fossilized worms trails published by Raup and Seilacher (1969), computer scientist Mike Paterson at the University of Warwick and ...

pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...

Let A be the area of a simply closed lattice polygon. Let B denote the number of lattice points on the polygon edges and I the number of points in the interior of the ...

The word "pole" is used prominently in a number of very different branches of mathematics. Perhaps the most important and widespread usage is to denote a singularity of a ...

Let p(d) be the probability that a random walk on a d-D lattice returns to the origin. In 1921, Pólya proved that p(1)=p(2)=1, (1) but p(d)<1 (2) for d>2. Watson (1939), ...

The Roman surface, also called the Steiner surface (not to be confused with the class of Steiner surfaces of which the Roman surface is a particular case), is a quartic ...

The rook is a chess piece that may move any number of spaces either horizontally or vertically per move. The maximum number of nonattacking rooks that may be placed on an n×n ...

A semiperfect magic cube, sometimes also called an "Andrews cube" (Gardner 1976; Gardner 1988, p. 219) is a magic cube for which the cross section diagonals do not sum to the ...