Search Results for ""

If f(z) is regular and of the form O(e^(k|z|)) where k<pi, for R[z]>=0, and if f(z)=0 for z=0, 1, ..., then f(z) is identically zero.

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

Apply Markov's inequality with a=k^2 to obtain P[(x-mu)^2>=k^2]<=(<(x-mu)^2>)/(k^2)=(sigma^2)/(k^2). (1) Therefore, if a random variable x has a finite mean mu and finite ...

The extangents triangle is homothetic to the orthic triangle, and its homothetic center is known as the Clawson point, or sometimes the "crucial point." It has equivalent ...

The downward Clenshaw recurrence formula evaluates a sum of products of indexed coefficients by functions which obey a recurrence relation. If f(x)=sum_(k=0)^Nc_kF_k(x) (1) ...

The coboundary polynomial chi^__G(q,t) is a bivariate graph polynomial which can be expressed in terms of the Tutte polynomial T_G(x,y) of a graph G by ...

The expected number of trials needed to collect a complete set of n different objects when picked at random with repetition is nH_n (Havil 2003, p. 131). For n=1, 2, ..., the ...

The differential forms on C^n decompose into forms of type (p,q), sometimes called (p,q)-forms. For example, on C, the exterior algebra decomposes into four types: ^ C = ^ ^0 ...

A computation is an operation that begins with some initial conditions and gives an output which follows from a definite set of rules. The most common example are ...

A product of ANDs, denoted ^ _(k=1)^nA_k. The conjunctions of a Boolean algebra A of subsets of cardinality p are the 2^p functions A_lambda= union _(i in lambda)A_i, where ...