Search Results for ""

For any M, there exists a t^' such that the sequence n^2+t^', where n=1, 2, ... contains at least M primes.

A map x|->x^p where p is a prime.

Each prime factor p_i^(alpha_i) in an integer's prime factorization is called a primary.

A prime factorization algorithm.

Two numbers which are relatively prime.

For N=k·2^n+1 with k odd and 2^n>k, if there exists an integer a such that a^((N-1)/2)=-1 (mod N), then N is prime. A prime of this form is known as a Proth prime.

A test which always identifies prime numbers correctly, but may incorrectly identify a composite number as a prime.

An interprime is the average of consecutive (but not necessarily twin) odd primes. The first few terms are 4, 6, 9, 12, 15, 18, 21, 26, 30, 34, ... (OEIS A024675). The first ...

A Cullen number is a number of the form C_n=2^nn+1. The first few are 3, 9, 25, 65, 161, 385, ... (OEIS A002064). Cullen numbers are divisible by p=2n-1 if p is a prime of ...

A double Mersenne number is a number of the form M_(M_n)=2^(2^n-1)-1, where M_n is a Mersenne number. The first few double Mersenne numbers are 1, 7, 127, 32767, 2147483647, ...