Search Results for ""

Synthetic division is a shortcut method for dividing two polynomials which can be used in place of the standard long division algorithm. This method reduces the dividend and ...

An operator T which maps some basic polynomial sequence p_n(x) into another basic polynomial sequence q_n(x).

Let the greatest term H of a sequence be a term which is greater than all but a finite number of the terms which are equal to H. Then H is called the upper limit of the ...

Weak convergence is usually either denoted x_nw; ->x or x_n->x. A sequence {x_n} of vectors in an inner product space E is called weakly convergent to a vector in E if ...

If for each positive integer h, the sequence {u_(n+h)-u_n} is uniformly distributed (mod 1), then the sequence {u_n} is uniformly distributed (mod 1) (Montgomery 2001).

An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...

A string or word is said to be admissible if that word appears in a given sequence. For example, in the sequence aabaabaabaabaab..., a, aa, baab are all admissible, but bb is ...

The map H_n(X,A)->H_(n-1)(A) appearing in the long exact sequence of a pair axiom.

A binary plot of an integer sequence is a plot of the binary representations of successive terms where each term is represented as a column of bits with 1s colored black and ...

Fractran is an algorithm applied to a given list f_1, f_2, ..., f_k of fractions. Given a starting integer N, the FRACTRAN algorithm proceeds by repeatedly multiplying the ...