Search Results for ""

An ordinal number alpha>0 is called a limit ordinal iff it has no immediate predecessor, i.e., if there is no ordinal number beta such that beta+1=alpha (Ciesielski 1997, p. ...

The Littlewood conjecture states that for any two real numbers x,y in R, lim inf_(n->infty)n|nx-nint(nx)||ny-nint(ny)|=0 where nint(z) denotes the nearest integer function. ...

A topological space X is semilocally simply connected (also called semilocally 1-connected) if every point x in X has a neighborhood U such that any loop L:[0,1]->U with ...

A collection of subsets of a topological space that is contained in a basis of the topology and can be completed to a basis when adding all finite intersections of the ...

Linear Algebra

Trigonometry

How far can a stack of n books protrude over the edge of a table without the stack falling over? It turns out that the maximum overhang possible d_n for n books (in terms of ...

Let there be n>=2 integers 0<a_1<...<a_n with GCD(a_1,a_2,...,a_n)=1. The values a_i represent the denominations of n different coins, where these denominations have greatest ...

Hex is a two-player game invented by Piet Hein in 1942 while a student at Niels Bohr's Institute for Theoretical Physics, and subsequently and independently by John Nash in ...

A Hamiltonian path, also called a Hamilton path, is a graph path between two vertices of a graph that visits each vertex exactly once. If a Hamiltonian path exists whose ...