Search Results for ""
1031 - 1040 of 4349 for prime numbersSearch Results
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. ...
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 ...
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 ...
The tangent numbers, also called a zag number, and given by T_n=(2^(2n)(2^(2n)-1)|B_(2n)|)/(2n), (1) where B_n is a Bernoulli number, are numbers that can be defined either ...
The number of cells in a generalized Chinese checkers board (or "centered" hexagram). Unlike the polygonal numbers, there is ambiguity in the case of the star numbers as to ...
Multiply all the digits of a number n by each other, repeating with the product until a single digit is obtained. The number of steps required is known as the multiplicative ...
There are several theorems known as the "sandwich theorem." In calculus, the squeeze theorem is also sometimes known as the sandwich theorem. In graph theory, the sandwich ...
...
View search results from all Wolfram sites (34076 matches)

