Search Results for ""

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.

The second theorem of Mertens states that the asymptotic form of the harmonic series for the sum of reciprocal primes is given by sum_(p<=x)1/p=lnlnx+B_1+o(1), where p is a ...

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

The Chebyshev integral is given by intx^p(1-x)^qdx=B(x;1+p,1+q), where B(x;a,b) is an incomplete beta function.

Alpha is the name for the first letter in the Greek alphabet: alpha. In finance, alpha is a financial measure giving the difference between a fund's actual return and its ...

A process of successively crossing out members of a list according to a set of rules such that only some remain. The best known sieve is the sieve of Eratosthenes for ...

Landau's problems are the four "unattackable" problems mentioned by Landau in the 1912 Fifth Congress of Mathematicians in Cambridge, namely: 1. The Goldbach conjecture, 2. ...

The Gram series is an approximation to the prime counting function given by G(x)=1+sum_(k=1)^infty((lnx)^k)/(kk!zeta(k+1)), (1) where zeta(z) is the Riemann zeta function ...

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, ...

B_(p+k)=B_k+B_(k+1) (mod p), when p is prime and B_n is a Bell number.