Search Results for ""

Hardy and Littlewood (1914) proved that the sequence {frac(x^n)}, where frac(x) is the fractional part, is equidistributed for almost all real numbers x>1 (i.e., the ...

An extended rooted binary tree satisfying the following conditions: 1. Every node has two children, each colored either red or black. 2. Every tree leaf node is colored ...

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 ...

Smale's problems are a list of 18 challenging problems for the twenty-first century proposed by Field medalist Steven Smale. These problems were inspired in part by Hilbert's ...

Taking a connected graph or network with a high graph diameter and adding a very small number of edges randomly, the diameter tends to drop drastically. This is known as the ...

Sphere tetrahedron picking is the selection of quadruples of of points corresponding to vertices of a tetrahedron with vertices on the surface of a sphere. n random ...

A leaf of an unrooted tree is a node of vertex degree 1. Note that for a rooted or planted tree, the root vertex is generally not considered a leaf node, whereas all other ...

The problem of finding the mean triangle area of a triangle with vertices picked inside a triangle with unit area was proposed by Watson (1865) and solved by Sylvester. It ...

The abc conjecture is a conjecture due to Oesterlé and Masser in 1985. It states that, for any infinitesimal epsilon>0, there exists a constant C_epsilon such that for any ...

Consider the probability Q_1(n,d) that no two people out of a group of n will have matching birthdays out of d equally possible birthdays. Start with an arbitrary person's ...