Search Results for ""

An arithmetic progression, also known as an arithmetic sequence, is a sequence of n numbers {a_0+kd}_(k=0)^(n-1) such that the differences between successive terms is a ...

For a sequence {chi_i}, the Levine-O'Sullivan greedy algorithm is given by chi_1 = 1 (1) chi_i = max_(1<=j<=i-1)(j+1)(i-chi_j) (2) for i>1. The sequence generated by this ...

The lower-trimmed subsequence of x={x_n} is the sequence V(x) obtained by subtracting 1 from each x_n and then removing all 0s. If x is a fractal sequence, then V(x) is a ...

An array A=a_(ij), i,j>=1 of positive integers is called an interspersion if 1. The rows of A comprise a partition of the positive integers, 2. Every row of A is an ...

A sequence {x_n} is called an infinitive sequence if, for every i, x_n=i for infinitely many n. Write a(i,j) for the jth index n for which x_n=i. Then as i and j range ...

Given a sequence of values {a_k}_(k=1)^n, the running maxima are the sequence of values {max(a_1,...,a_k)}_(k=1)^n. So, for example, given a sequence (3,5,7,8,8,5,7,9,2,5), ...

Given a sequence of real numbers a_n, the supremum limit (also called the limit superior or upper limit), written lim sup and pronounced 'lim-soup,' is the limit of ...

A class of curve defined at integer values which hops from one value to another. Their name derives from the Greek word betaalphataurhoalphachiiotaomicronnu batrachion, which ...

The moment problem, also called "Hausdorff's moment problem" or the "little moment problem," may be stated as follows. Given a sequence of numbers {mu_n}_(n=0)^infty, under ...

In Book IX of The Elements, Euclid gave a method for constructing perfect numbers (Dickson 2005, p. 3), although this method applies only to even perfect numbers. In a 1638 ...