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

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

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

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

The Harborth graph is the smallest known 4-regular matchstick graph. It is therefore both planar and unit-distance. It has 104 edges and 52 vertices. This graph was named ...

An amicable pair (m,n) consists of two integers m,n for which the sum of proper divisors (the divisors excluding the number itself) of one number equals the other. Amicable ...

The prime counting function is the function pi(x) giving the number of primes less than or equal to a given number x (Shanks 1993, p. 15). For example, there are no primes ...

Twin primes are pairs of primes of the form (p, p+2). The term "twin prime" was coined by Paul Stäckel (1862-1919; Tietze 1965, p. 19). The first few twin primes are n+/-1 ...