Search Results for ""

By asking a small number of innocent-sounding questions about an unknown number, it is possible to reconstruct the number with absolute certainty (assuming that the questions ...

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

The base-26 number system composed of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 and the letters A-P.

A random number which lies within a specified range (which can, without loss of generality, be taken as [0, 1]), with a uniform distribution.

The grouping of data into bins (spaced apart by the so-called class interval) plotting the number of members in each bin versus the bin number. The above histogram shows the ...

A partition whose conjugate partition is equivalent to itself. The Ferrers diagrams corresponding to the self-conjugate partitions for 3<=n<=10 are illustrated above. The ...

A (0,1)-matrix is an integer matrix in which each element is a 0 or 1. It is also called a logical matrix, binary matrix, relation matrix, or Boolean matrix. The number of ...

Consider the decimal expansion of the reciprocal of the number seven, 1/7=0.142857142857...=0.142857^_, (1) which is a repeating decimal. Now take overlapping pairs of these ...

The first Göllnitz-Gordon identity states that the number of partitions of n in which the minimal difference between parts is at least 2, and at least 4 between even parts, ...

To define a recurring digital invariant of order k, compute the sum of the kth powers of the digits of a number n. If this number n^' is equal to the original number n, then ...