Search Results for ""

Let the least term h of a sequence be a term which is smaller than all but a finite number of the terms which are equal to h. Then h is called the lower limit of the ...

The power polynomials x^n are an associated Sheffer sequence with f(t)=t, (1) giving generating function sum_(k=0)^inftyx^kt^k=1/(1-tx) (2) and exponential generating ...

An odd composite number N is called a Somer-Lucas d-pseudoprime (with d>=1) if there exists a nondegenerate Lucas sequence U(P,Q) with U_0=0, U_1=1, D=P^2-4Q, such that ...

Strong convergence is the type of convergence usually associated with convergence of a sequence. More formally, a sequence {x_n} of vectors in a normed space (and, in ...

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