Search Results for ""

Grimm conjectured that if n+1, n+2, ..., n+k are all composite numbers, then there are distinct primes p_(i_j) such that p_(i_j)|(n+j) for 1<=j<=k.

A Mersenne number is a number of the form M_n=2^n-1, (1) where n is an integer. The Mersenne numbers consist of all 1s in base-2, and are therefore binary repunits. The first ...

An expression that is of a given type. For example, all primes p>3 are "of the form" 6n+/-1. The term "of shape" is sometimes also used.

A pair of consecutive primes whose digits are rearrangements of each other, first considered by A. Edwards in Aug. 2001. The first few are (1913, 1931), (18379, 18397), ...

An expression describing a form in which a quantity can be written. For example, all primes p>3 can be "represented as" 6n+/-1.

A Shanks (a,b)-chain is a sequence of primes p_i of the form p_(i+1)=ap_i^2-b, with a and b integers. On Sep. 1, 2000, P. Leyland found a (4, 17)-chain of length 6, and on ...

The minimal polynomial S_n(x) whose roots are sums and differences of the square roots of the first n primes, ...

A number N=p_1p_2...p_n where the p_is are distinct primes and n>=3 such that p_i=Ap_(i-1)+B (1) for i=1, 2, ..., n, p_0 taken as 1, and with A and B some fixed integers. For ...

An integer j(n) is called a jumping champion if j(n) is the most frequently occurring difference between consecutive primes <=n (Odlyzko et al. 1999). This term was coined by ...

There are several types of numbers that are commonly termed "lucky numbers." The first is the lucky numbers of Euler. The second is obtained by writing out all odd numbers: ...