Search Results for ""

A Markov chain is collection of random variables {X_t} (where the index t runs through 0, 1, ...) having the property that, given the present, the future is conditionally ...

The sequence {|_(3/2)^n_|} is given by 1, 1, 2, 3, 5, 7, 11, 17, 25, 38, ... (OEIS A002379). The first few composite |_(3/2)^n_| occur for n=8, 9, 10, 11, 12, 13, 14, 15, 16, ...

A sequence {x_1,x_2,...} is equidistributed iff lim_(N->infty)1/Nsum_(n<N)e^(2piimx_n)=0 for each m=1, 2, .... A consequence of this result is that the sequence {frac(nx)} is ...

Wynn's epsilon-method is a method for numerical evaluation of sums and products that samples a number of additional terms in the series and then tries to extrapolate them by ...

A set (usually of letters) from which a subset is drawn. A sequence of letters is called a word, and a set of words is called a code.

The Cantor set T_infty, sometimes also called the Cantor comb or no middle third set (Cullen 1968, pp. 78-81), is given by taking the interval [0,1] (set T_0), removing the ...

A necessary and sufficient condition for a sequence S_i to converge. The Cauchy criterion is satisfied when, for all epsilon>0, there is a fixed number N such that ...

Consecutive number sequences are sequences constructed by concatenating numbers of a given type. Many of these sequences were considered by Smarandache and so are sometimes ...

A series is said to be convergent if it approaches some limit (D'Angelo and West 2000, p. 259). Formally, the infinite series sum_(n=1)^(infty)a_n is convergent if the ...

U_n(f)=int_a^bf(x)K_n(x)dx, where {K_n(x)} is a sequence of continuous functions.