Search Results for ""

A random matrix is a matrix of given type and size whose entries consist of random numbers from some specified distribution. Random matrix theory is cited as one of the ...

Defining p_0=2, p_n as the nth odd prime, and the nth prime gap as g_n=p_(n+1)-p_n, then the Cramér-Granville conjecture states that g_n<M(lnp_n)^2 for some constant M>1.

The first of the Hardy-Littlewood conjectures. The k-tuple conjecture states that the asymptotic number of prime constellations can be computed explicitly. In particular, ...

Let n be a positive number having primitive roots. If g is a primitive root of n, then the numbers 1, g, g^2, ..., g^(phi(n)-1) form a reduced residue system modulo n, where ...

Let where (alpha)_j is a Pochhammer symbol, and let alpha be a negative integer. Then S(alpha,beta,m;z)=(Gamma(beta+1-m))/(Gamma(alpha+beta+1-m)), where Gamma(z) is the gamma ...

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.

Legendre's conjecture asserts that for every n there exists a prime p between n^2 and (n+1)^2 (Hardy and Wright 1979, p. 415; Ribenboim 1996, pp. 397-398). It is one of ...

For R[n]>-1 and R[z]>0, Pi(z,n) = n^zint_0^1(1-x)^nx^(z-1)dx (1) = (n!)/((z)_(n+1))n^z (2) = B(z,n+1), (3) where (z)_n is the Pochhammer symbol and B(p,q) is the beta ...