Search Results for ""

A modified Miller's primality test which gives a guarantee of primality or compositeness. The algorithm's running time for a number n has been proved to be as ...

Stanley's theorem states that the total number of 1s that occur among all unordered partitions of a positive integer is equal to the sum of the numbers of distinct members of ...

The first of the Hardy-Littlewood conjectures. The k-tuple conjecture states that the asymptotic number of prime constellations can be computed explicitly. In particular, ...

Some interesting properties (as well as a few arcane ones not reiterated here) of the number 239 are discussed in Schroeppel (1972). 239 appears in Machin's formula ...

According to the novel The Hitchhiker's Guide to the Galaxy (Adams 1997), 42 is the ultimate answer to life, the universe, and everything. Unfortunately, it is left as an ...

Let A and B be any sets with empty intersection, and let |X| denote the cardinal number of a set X. Then |A|+|B|=|A union B| (Ciesielski 1997, p. 68; Dauben 1990, p. 173; ...

A prime number obtained by reading digits around an analog clock. In a clockwise direction, the primes are 2, 3, 5, 7, 11, 23, 67, 89, 4567, 23456789, 23456789101112123, ... ...

The modulus of a complex number z, also called the complex norm, is denoted |z| and defined by |x+iy|=sqrt(x^2+y^2). (1) If z is expressed as a complex exponential (i.e., a ...

Two complex numbers x=a+ib and y=c+id are multiplied as follows: xy = (a+ib)(c+id) (1) = ac+ibc+iad-bd (2) = (ac-bd)+i(ad+bc). (3) In component form, ...

A deletable prime is a prime number which has the property that deleting digits one at a time in some order gives a prime at each step. For example, 410256793 is a deletable ...