Search Results for ""

The Baum-Sweet sequence is the sequence of numbers {b_n} such that b_n=1 if the binary representation of n contains no block of consecutive 0s of odd length, and b_n=0 ...

A C^infty function is a function that is differentiable for all degrees of differentiation. For instance, f(x)=e^(2x) (left figure above) is C^infty because its nth ...

Given A = |a_(11)-x a_(12) ... a_(1m); a_(21) a_(22)-x ... a_(2m); | | ... |; a_(m1) a_(m2) ... a_(mm)-x| (1) = x^m+c_(m-1)x^(m-1)+...+c_0, (2) then ...

The Cesàro means of a function f are the arithmetic means sigma_n=1/n(s_0+...+s_(n-1)), (1) n=1, 2, ..., where the addend s_k is the kth partial sum ...

The characteristic equation is the equation which is solved to find a matrix's eigenvalues, also called the characteristic polynomial. For a general k×k matrix A, 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, ...

A Gaussian quadrature-like formula for numerical estimation of integrals. It uses weighting function W(x)=1 in the interval [-1,1] and forces all the weights to be equal. The ...

The circle method is a method employed by Hardy, Ramanujan, and Littlewood to solve many asymptotic problems in additive number theory, particularly in deriving an asymptotic ...

Clausen's _4F_3 identity _4F_3(a,b,c,d; e,f,g;1)=((2a)_(|d|)(a+b)_(|d|)(2b)_(|d|))/((2a+2b)_(|d|)a_(|d|)b_(|d|)), (1) holds for a+b+c-d=1/2, e=a+b+1/2, a+f=d+1=b+g, where d a ...

Cluster analysis is a technique used for classification of data in which data elements are partitioned into groups called clusters that represent collections of data elements ...