Search Results for ""
211 - 220 of 1277 for Chebyshev PolynomialSearch Results
![](/common/images/search/spacer.gif)
A generalization of the complete beta function defined by B(z;a,b)=int_0^zu^(a-1)(1-u)^(b-1)du, (1) sometimes also denoted B_z(a,b). The so-called Chebyshev integral is given ...
The so-called explicit formula psi(x)=x-sum_(rho)(x^rho)/rho-ln(2pi)-1/2ln(1-x^(-2)) gives an explicit relation between prime numbers and Riemann zeta function zeros for x>1 ...
By way of analogy with the prime counting function pi(x), the notation pi_(a,b)(x) denotes the number of primes of the form ak+b less than or equal to x (Shanks 1993, pp. ...
The product of primes p_n#=product_(k=1)^np_k, (1) with p_n the nth prime, is called the primorial function, by analogy with the factorial function. Its logarithm is closely ...
Orthogonal polynomials are classes of polynomials {p_n(x)} defined over a range [a,b] that obey an orthogonality relation int_a^bw(x)p_m(x)p_n(x)dx=delta_(mn)c_n, (1) where ...
For n a positive integer, expressions of the form sin(nx), cos(nx), and tan(nx) can be expressed in terms of sinx and cosx only using the Euler formula and binomial theorem. ...
A linear recurrence equation is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a first-degree polynomial in x_k with k<n. For example ...
Elliptic rational functions R_n(xi,x) are a special class of rational functions that have nice properties for approximating other functions over the interval x in [-1,1]. In ...
A distribution of error such that the error remaining is always given approximately by the last term dropped.
A unimodular matrix is a real square matrix A with determinant det(A)=+/-1 (Born and Wolf 1980, p. 55; Goldstein 1980, p. 149). More generally, a matrix A with elements in ...
![](/common/images/search/spacer.gif)
...