Search Results for ""

The intersection number omega(G) of a given graph G is the minimum number of elements in a set S such that G is an intersection graph on S.

A number which can be computed to any number of digits desired by a Turing machine. Surprisingly, most irrationals are not computable numbers!

Square line picking is the selection of pairs of points (corresponding to endpoints of a line segment) randomly placed inside a square. n random line segments can be picked ...

An even number is an integer of the form n=2k, where k is an integer. The even numbers are therefore ..., -4, -2, 0, 2, 4, 6, 8, 10, ... (OEIS A005843). Since the even ...

The ordered pair (s,t), where s is the number of real embeddings of the number field and t is the number of complex-conjugate pairs of embeddings. The degree of the number ...

An n×n magic square for which every pair of numbers symmetrically opposite the center sum to n^2+1. The Lo Shu is associative but not panmagic. The numbers of associative ...

What is the area of the largest square that can be inscribed on a unit cube (Trott 2004, p. 104)? The answer is 9/8, given by a square with vertices (1/4, 0, 0), (0, 1, 1/4), ...

The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...

A Ramsey number of the form R(k,k;2).

A 10-digit number satisfying the following property. Number the digits 0 to 9, and let digit n be the number of ns in the number. There is exactly one such number: 6210001000.