Search Results for ""

Guy's conjecture, which has not yet been proven or disproven, states that the graph crossing number for a complete graph K_n is ...

The first Hardy-Littlewood conjecture is called the k-tuple conjecture. It states that the asymptotic number of prime constellations can be computed explicitly. A particular ...

An integer j(n) is called a jumping champion if j(n) is the most frequently occurring difference between consecutive primes <=n (Odlyzko et al. 1999). This term was coined by ...

Lehmer (1938) showed that every positive irrational number x has a unique infinite continued cotangent representation of the form x=cot[sum_(k=0)^infty(-1)^kcot^(-1)b_k], (1) ...

Consider decomposition the factorial n! into multiplicative factors p_k^(b_k) arranged in nondecreasing order. For example, 4! = 3·2^3 (1) = 2·3·4 (2) = 2·2·2·3 (3) and 5! = ...

Find a way to stack a square of cannonballs laid out on the ground into a square pyramid (i.e., find a square number which is also square pyramidal). This corresponds to ...

A Diophantine problem (i.e., one whose solution must be given in terms of integers) which seeks a solution to the following problem. Given n men and a pile of coconuts, each ...

The irrational constant R = e^(pisqrt(163)) (1) = 262537412640768743.9999999999992500... (2) (OEIS A060295), which is very close to an integer. Numbers such as the Ramanujan ...

Let n be a positive number having primitive roots. If g is a primitive root of n, then the numbers 1, g, g^2, ..., g^(phi(n)-1) form a reduced residue system modulo n, where ...

A graph G having chromatic number gamma(G)=k is called a k-chromatic graph (Harary 1994, p. 127). In contrast, a graph having gamma(G)<=k is said to be a k-colorable graph. A ...