Search Results for ""

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

A fractal curve created from the base curve and motif illustrated above (Lauwerier 1991, p. 37). As illustrated above, the number of segments after the nth iteration is ...

Minkowski space is a four-dimensional space possessing a Minkowski metric, i.e., a metric tensor having the form dtau^2=-(dx^0)^2+(dx^1)^2+(dx^2)^2+(dx^3)^2. Alternatively ...

A phenomenon in which a system being forced at an irrational period undergoes rational, periodic motion which persists for a finite range of forcing values. It may occur for ...

A Diophantine problem (i.e., one whose solution must be given in terms of integers) which seeks a solution to the following problem. Given n men and a pile of coconuts, each ...

The Mordell conjecture states that Diophantine equations that give rise to surfaces with two or more holes have only finite many solutions in Gaussian integers with no common ...

The first definition of the logarithm was constructed by Napier and popularized through his posthumous pamphlet (Napier 1619). It this pamphlet, Napier sought to reduce the ...

Let A, B, and C be three circles in the plane, and let X be any circle touching B and C. Then build up a chain of circles such that Y:CAX, Z:ABY, X^':BCZ, Y^':CAX^', ...

For 2<=n<=32, it is possible to select 2n lattice points with x,y in [1,n] such that no three are in a straight line (where "straight line" means any line in the plane--not ...

The following table gives the number of nonadjacent vertex pairs k on graphs of n=1, 2, ... vertices. k counts 1 0, 1, 1, 1, 1, 1, 1, ... 2 0, 0, 1, 2, 2, 2, 2, ... 3 0, 0, ...