Search Results for ""

There are at least two statements which go by the name of Artin's conjecture. If r is any complex finite-dimensional representation of the absolute Galois group of a number ...

The constant lambda=1.303577269034296... (OEIS A014715) giving the asymptotic rate of growth Clambda^n of the number of digits in the nth term of the look and say sequence, ...

The base-12 number system composed of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B. Such a system has been advocated by no less than Herbert Spencer, John Quincy Adams, and ...

The simple continued fraction of the Golomb-Dickman constant lambda is [0; 1, 1, 1, 1, 1, 22, 1, 2, 3, 1, 1, 11, ...] (OEIS A225336). Note that this continued fraction ...

The gonality (also called divisorial gonality) gon(G) of a (finite) graph G is the minimum degree of a rank 1 divisor on that graph. It can be thought of as the minimum ...

A googol is a large number equal to 10^(10^2)=10^(100) (i.e., a 1 with 100 zeros following it). Written out explicitly, ...

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