Search Results for ""

If R is a ring (commutative with 1), the height of a prime ideal p is defined as the supremum of all n so that there is a chain p_0 subset ...p_(n-1) subset p_n=p where all ...

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.

A composite number n is a positive integer n>1 which is not prime (i.e., which has factors other than 1 and itself). The first few composite numbers (sometimes called ...

The totient function phi(n), also called Euler's totient function, is defined as the number of positive integers <=n that are relatively prime to (i.e., do not contain any ...

The Machin-like formula 1/4pi=cot^(-1)2+cot^(-1)5+cot^(-1)8.

The Fermat number F_n is prime iff 3^(2^(2^n-1))=-1 (mod F_n).

In 1891, Chebyshev and Sylvester showed that for sufficiently large x, there exists at least one prime number p satisfying x<p<(1+alpha)x, where alpha=0.092.... Since the ...

The second Mersenne prime M_3=2^3-1, which is itself the exponent of Mersenne prime M_7=2^7-1=127. It gives rise to the perfect number P_7=M_7·2^6=8128. It is a Gaussian ...

An interpolation formula, sometimes known as the Newton-Bessel formula, given by (1) for p in [0,1], where delta is the central difference and B_(2n) = 1/2G_(2n) (2) = ...

Let P be a prime ideal in D_m not containing m. Then (Phi(P))=P^(sumtsigma_t^(-1)), where the sum is over all 1<=t<m which are relatively prime to m. Here D_m is the ring of ...