Search Results for ""

The tower of Hanoi (commonly also known as the "towers of Hanoi"), is a puzzle invented by E. Lucas in 1883. It is also known as the Tower of Brahma puzzle and appeared as an ...

A compositeness certificate is a piece of information which guarantees that a given number p is composite. Possible certificates consist of a factor of a number (which, in ...

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...

A parallelogram polyomino is a polyomino such that the intersection with every line perpendicular to the main diagonal is a connected segment. The number of parallelogram ...

Prellberg (2001) noted that the limit c=lim_(n->infty)(T_n)/(B_nexp{1/2[W(n)]^2})=2.2394331040... (OEIS A143307) exists, where T_n is a Takeuchi number, B_n is a Bell number, ...

Let the stick number s(K) of a knot K be the least number of straight sticks needed to make a knot K. The smallest stick number of any knot is s(T)=6, where T is the trefoil ...

An even number N for which N=0 (mod 4). The first few positive doubly even numbers are 4, 8, 12, 16, ... (OEIS A008586).

The mathematical golden rule states that, for any fraction, both numerator and denominator may be multiplied by the same number without changing the fraction's value.

A type of diagram invented by Lewis Carroll (the name is an abbreviation of "Lewis") that can be used to determine the number of minimal covers of n numbers with k members.

The smallest number of times u(K) a knot K must be passed through itself to untie it. Lower bounds can be computed using relatively straightforward techniques, but it is in ...