Search Results for ""

The Cantor set T_infty, sometimes also called the Cantor comb or no middle third set (Cullen 1968, pp. 78-81), is given by taking the interval [0,1] (set T_0), removing the ...

The Copeland-Erdős constant has decimal expansion C=0.23571113... (OEIS A033308). The Earls sequence (starting position of n copies of the digit n) for e is given for n=1, 2, ...

Two nonisomorphic graphs can share the same graph spectrum, i.e., have the same eigenvalues of their adjacency matrices. Such graphs are called cospectral. For example, the ...

Euclid's second theorem states that the number of primes is infinite. The proof of this can be accomplished using the numbers E_n = 1+product_(i=1)^(n)p_i (1) = 1+p_n#, (2) ...

The decimal expansion of the Glaisher-Kinkelin constant is given by A=1.28242712... (OEIS A074962). A was computed to 5×10^5 decimal digits by E. Weisstein (Dec. 3, 2015). ...

The decimal expansion of the Golomb-Dickman constant is given by lambda=0.6243299885... (OEIS A084945). Mitchell (1968) computed lambda to 53 decimal places. lambda has been ...

The Lucas-Lehmer test is an efficient deterministic primality test for determining if a Mersenne number M_n is prime. Since it is known that Mersenne numbers can only be ...

Roughly speaking, a matroid is a finite set together with a generalization of a concept from linear algebra that satisfies a natural set of properties for that concept. For ...

Dickson states "In a letter to Tanner [L'intermediaire des math., 2, 1895, 317] Lucas stated that Mersenne (1644, 1647) implied that a necessary and sufficient condition that ...

A prime partition of a positive integer n>=2 is a set of primes p_i which sum to n. For example, there are three prime partitions of 7 since 7=7=2+5=2+2+3. The number of ...