Search Results for ""

The Mangoldt function is the function defined by Lambda(n)={lnp if n=p^k for p a prime; 0 otherwise, (1) sometimes also called the lambda function. exp(Lambda(n)) has the ...

A sum in which subsequent terms cancel each other, leaving only initial and final terms. For example, S = sum_(i=1)^(n-1)(a_i-a_(i+1)) (1) = ...

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

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

Consider the Lagrange interpolating polynomial f(x)=b_0+(x-1)(b_1+(x-2)(b_3+(x-3)+...)) (1) through the points (n,p_n), where p_n is the nth prime. For the first few points, ...

Approximates the possible values of y in terms of x if sum_(i,j=0)^na_(ij)x^iy^j=0.

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

For a given function f(x) over a partition of a given interval, the lower sum is the sum of box areas m^*Deltax_k using the infimum m of the function f(x) in each subinterval ...

A sum over all cluster perimeters.

rho_(2s)(n)=(pi^s)/(Gamma(s))n^(s-1)sum_(p,q)((S_(p,q))/q)^(2s)e^(2nppii/q), where S_(p,q) is a Gaussian sum, and Gamma(s) is the gamma function.