Search Results for ""

The Wythoff array is an interspersion array that can be constructed by beginning with the Fibonacci numbers {F_2,F_3,F_4,F_5,...} in the first row and then building up ...

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.

The sequence generated by repeated application of a map. The map is said to have a closed orbit if it has a finite number of elements.

The transformation of a sequence a_1, a_2, ... with a_n=sum_(d|n)b_d (1) into the sequence b_1, b_2, ... via the Möbius inversion formula, b_n=sum_(d|n)mu(n/d)a_d. (2) The ...

If {f_n} is a sequence of measurable functions, with 0<=f_n<=f_(n+1) for every n, then intlim_(n->infty)f_ndmu=lim_(n->infty)intf_ndmu.