Search Results for ""

It is always possible to "fairly" divide a cake among n people using only vertical cuts. Furthermore, it is possible to cut and divide a cake such that each person believes ...

An official chessboard is an 8×8 board containing squares alternating in color between olive green and buff (where "buff" is a color variously defined as a moderate orange ...

A chordal graph is a simple graph in which every graph cycle of length four and greater has a cycle chord. In other words, a chordal graph is a graph possessing no chordless ...

The conjugate gradient method can be applied on the normal equations. The CGNE and CGNR methods are variants of this approach that are the simplest methods for nonsymmetric ...

The Earls sequence gives the starting position in the decimal digits of pi (or in general, any constant), not counting digits to the left of the decimal point, at which a ...

A Gaussian integer is a complex number a+bi where a and b are integers. The Gaussian integers are members of the imaginary quadratic field Q(sqrt(-1)) and form a ring often ...

Gaussian primes are Gaussian integers z=a+bi satisfying one of the following properties. 1. If both a and b are nonzero then, a+bi is a Gaussian prime iff a^2+b^2 is an ...

Go is played on a 19×19 grid, with pieces being placed at the intersections of grid lines, rather than in the middle of them. Go boards have a number of peculiarities, ...

A graph H is a minor of a graph G if a copy of H can be obtained from G via repeated edge deletion and/or edge contraction. The Kuratowski reduction theorem states that any ...

For a connected bipartite graph G, the halved graph G^+ and G^- are the two connected components of the distance 2-graph of G. The following table summarizes some named ...