Search Results for ""

The Chebotarev density theorem is a complicated theorem in algebraic number theory which yields an asymptotic formula for the density of prime ideals of a number field K that ...

Chebyshev-Gauss quadrature, also called Chebyshev quadrature, is a Gaussian quadrature over the interval [-1,1] with weighting function W(x)=(1-x^2)^(-1/2) (Abramowitz and ...

A Gaussian quadrature-like formula over the interval [-1,1] which has weighting function W(x)=x. The general formula is int_(-1)^1xf(x)dx=sum_(i=1)^nw_i[f(x_i)-f(-x_i)]. 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 ...

A number of spellings of "Chebyshev" (which is the spelling used exclusively in this work) are commonly found in the literature. These include Tchebicheff, Čebyšev, ...

Using a Chebyshev polynomial of the first kind T(x), define c_j = 2/Nsum_(k=1)^(N)f(x_k)T_j(x_k) (1) = 2/Nsum_(k=1)^(N)f[cos{(pi(k-1/2))/N}]cos{(pij(k-1/2))/N}. (2) Then f(x) ...

Chebyshev noticed that the remainder upon dividing the primes by 4 gives 3 more often than 1, as plotted above in the left figure. Similarly, dividing the primes by 3 gives 2 ...

The constants lambda_(m,n)=inf_(r in R_(m,n))sup_(x>=0)|e^(-x)-r(x)|, where r(x)=(p(x))/(q(x)), p and q are mth and nth order polynomials, and R_(m,n) is the set of all ...

max_(a<=x<=b){|f(x)-rho(x)|w(x)}.

(1-x^2)(d^2y)/(dx^2)-x(dy)/(dx)+alpha^2y=0 (1) for |x|<1. The Chebyshev differential equation has regular singular points at -1, 1, and infty. It can be solved by series ...