Search Results for ""

A Colbert number is any prime number with more than 1000000 decimal digits whose discovery contributes to the long-sought after proof that k=78557 is the smallest Sierpiński ...

A number n is called an Egyptian number if it is the sum of the denominators in some unit fraction representation of a positive whole number not consisting entirely of 1s. ...

A Proth number is a number of the form N=k·2^n+1 for odd k, n a positive integer, and 2^n>k. The 2^n>k condition is needed since otherwise, every odd number >1 would be a ...

A round number is a number that is the product of a considerable number of comparatively small factors (Hardy 1999, p. 48). Round numbers are very rare. As Hardy (1999, p. ...

The Gelfond-Schneider constant is sometimes known as the Hilbert number. Flannery and Flannery (2000, p. 35) define a Hilbert number as a positive integer of the form n=4k+1 ...

Consider an n-digit number k. Square it and add the right n digits to the left n or n-1 digits. If the resultant sum is k, then k is called a Kaprekar number. For example, 9 ...

A Carmichael number is an odd composite number n which satisfies Fermat's little theorem a^(n-1)-1=0 (mod n) (1) for every choice of a satisfying (a,n)=1 (i.e., a and n are ...

The (upper) matching number nu(G) of graph G, sometimes known as the edge independence number, is the size of a maximum independent edge set. Equivalently, it is the degree ...

Let p_n/q_n be the sequence of convergents of the continued fraction of a number alpha. Then a Brjuno number is an irrational number such that ...

A positive integer: 1, 2, 3, 4, ... (OEIS A000027), also called a natural number. However, zero (0) is sometimes also included in the list of counting numbers. Due to lack of ...