Search Results for ""

The Mertens constant B_1, also known as the Hadamard-de la Vallee-Poussin constant, prime reciprocal constant (Bach and Shallit 1996, p. 234), or Kronecker's constant ...

Every "large" even number may be written as 2n=p+m where p is a prime and m in P union P_2 is the set of primes P and semiprimes P_2.

The Cramér conjecture is the unproven conjecture that lim sup_(n->infty)(p_(n+1)-p_n)/((lnp_n)^2)=1, where p_n is the nth prime.

Let p be an odd prime, k be an integer such that pk and 1<=k<=2(p+1), and N=2kp+1. Then the following are equivalent 1. N is prime. 2. There exists an a such that ...

Machin's formula is given by 1/4pi=4cot^(-1)5-cot^(-1)239. There are a whole class of Machin-like formulas with various numbers of terms (although only four such formulas ...

Newton's forward difference formula is a finite difference identity giving an interpolated value between tabulated points {f_p} in terms of the first value f_0 and the powers ...

A closed sentential formula is a sentential formula in which none of the variables are free (i.e., all variables are bound). Examples of closed sentential formulas are given ...

A primitive root of a prime p is an integer g such that g (mod p) has multiplicative order p-1 (Ribenboim 1996, p. 22). More generally, if GCD(g,n)=1 (g and n are relatively ...

The BBP (named after Bailey-Borwein-Plouffe) is a formula for calculating pi discovered by Simon Plouffe in 1995, ...

Let p(n) be the first prime which follows a prime gap of n between consecutive primes. Shanks' conjecture holds that p(n)∼exp(sqrt(n)). Wolf conjectures a slightly different ...