Search Results for ""

The prime number theorem gives an asymptotic form for the prime counting function pi(n), which counts the number of primes less than some integer n. Legendre (1808) suggested ...

The Erdős-Borwein constant E, sometimes also denoted alpha, is the sum of the reciprocals of the Mersenne numbers, E = sum_(n=1)^(infty)1/(2^n-1) (1) = ...

Given a series of positive terms u_i and a sequence of finite positive constants a_i, let rho=lim_(n->infty)(a_n(u_n)/(u_(n+1))-a_(n+1)). 1. If rho>0, the series converges. ...

Given a Taylor series f(x)=f(x_0)+(x-x_0)f^'(x_0)+((x-x_0)^2)/(2!)f^('')(x_0)+... +((x-x_0)^n)/(n!)f^((n))(x_0)+R_n, (1) the error R_n after n terms is given by ...

The q-analog of the binomial theorem (1-z)^n=1-nz+(n(n-1))/(1·2)z^2-(n(n-1)(n-2))/(1·2·3)z^3+... (1) is given by (1-z/(q^n))(1-z/(q^(n-1)))...(1-z/q) ...

Bracewell's term for the delta function.

Let {a_i}_(i=0)^(N-1) be a periodic sequence, then the autocorrelation of the sequence, sometimes called the periodic autocorrelation (Zwillinger 1995, p. 223), is the ...

A convergence test also called "de Morgan's and Bertrand's test." If the ratio of terms of a series {a_n}_(n=1)^infty can be written in the form ...

The exponential sum function e_n(x), sometimes also denoted exp_n(x), is defined by e_n(x) = sum_(k=0)^(n)(x^k)/(k!) (1) = (e^xGamma(n+1,x))/(Gamma(n+1)), (2) where ...

The generalized Riemann hypothesis conjectures that neither the Riemann zeta function nor any Dirichlet L-series has a zero with real part larger than 1/2. Compare with ...