Search Results for ""

The sequence produced by sorting the digits of a number and adding them to the previous number. The values starting with n=1, 2, ... are 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, ...

Determining the maximum number of pieces in which it is possible to divide a circle for a given number of cuts is called the circle cutting or pancake cutting problem. The ...

An irrational number x can be called GK-regular (defined here for the first time) if the distribution of its continued fraction coefficients is the Gauss-Kuzmin distribution. ...

A superior highly composite number is a positive integer n for which there is an e>0 such that (d(n))/(n^e)>=(d(k))/(k^e) for all k>1, where the function d(n) counts the ...

The Wolstenholme numbers are defined as the numerators of the generalized harmonic number H_(n,2) appearing in Wolstenholme's theorem. The first few are 1, 5, 49, 205, 5269, ...

1729 is sometimes called the Hardy-Ramanujan number. It is the smallest taxicab number, i.e., the smallest number which can be expressed as the sum of two cubes in two ...

For F_n the nth Fibonacci number, F_(n-1)F_(n+1)-F_n^2=(-1)^n. This identity was also discovered by Simson (Coxeter and Greitzer 1967, p. 41; Coxeter 1969, pp. 165-168; Wells ...

A Mersenne prime is a Mersenne number, i.e., a number of the form M_n=2^n-1, that is prime. In order for M_n to be prime, n must itself be prime. This is true since for ...

The number 10 (ten) is the basis for the decimal system of notation. In this system, each "decimal place" consists of a digit 0-9 arranged such that each digit is multiplied ...

There are at least two definitions of hypercomplex numbers. Clifford algebraists call their higher dimensional numbers hypercomplex, even though they do not share all the ...