Search Results for ""

Mills' theorem states that there exists a real constant A such that |_A^(3^n)_| is prime for all positive integers n (Mills 1947). While for each value of c>=2.106, there are ...

An Euler number prime is an Euler number E_n such that the absolute value |E_n| is prime (the absolute value is needed since E_n takes on alternating positive and negative ...

A twin prime cluster of order n is a collection of 2n consecutive prime numbers such that consecutive pairs form twin primes. Twin prime clusters were discussed by Mudge ...

A Wagstaff prime is a prime number of the form (2^p+1)/3 for p a prime number. The first few are given by p=3, 5, 7, 11, 13, 17, 19, 23, 31, 43, 61, 79, 101, 127, 167, 191, ...

A prime number p is called circular if it remains prime after any cyclic permutation of its digits. An example in base-10 is 1,193 because 1,931, 9,311, and 3,119 are all ...

A Woodall prime is a Woodall number W_n=2^nn-1 that is prime. The first few Woodall primes are 7, 23, 383, 32212254719, 2833419889721787128217599, ... (OEIS A050918), ...

The previous prime function PP(n) gives the largest prime less than n. The function can be given explicitly as PP(n)=p_(pi(n-1)), where p_i is the ith prime and pi(n) is the ...

A Belphegor prime (also known as a Beelphegor prime) is a prime Belphegor number, i.e., a palindromic prime of the form 1(0...)666(0...)1. The first few Belphegor primes are ...

The nth Ramanujan prime is the smallest number R_n such that pi(x)-pi(x/2)>=n for all x>=R_n, where pi(x) is the prime counting function. In other words, there are at least n ...

The factorization of a number into its constituent primes, also called prime decomposition. Given a positive integer n>=2, the prime factorization is written ...