Search Results for ""

A number of points on a line segment. The term was first used by Desargues (Cremona 1960, p. x). If the points A, B, C, ... lie on a line segment with the coordinates of the ...

A method for generating random (pseudorandom) numbers using the linear recurrence relation X_(n+1)=aX_n+c (mod m), where a and c must assume certain fixed values, m is some ...

A Lucas polynomial sequence is a pair of generalized polynomials which generalize the Lucas sequence to polynomials is given by W_n^k(x) = ...

Consider the local behavior of a map f:R^m->R^n by choosing a point x in R^m and an open neighborhood U subset R^m such that x in U. Now consider the set of all mappings ...

The mode of a set of observations is the most commonly occurring value. For example, for a data set (3, 7, 3, 9, 9, 3, 5, 1, 8, 5) (left histogram), the unique mode is 3. ...

Let g(x_1,...,x_n,y) be a function such that for any x_1, ..., x_n, there is at least one y such that g(x_1,...,x_n,y)=0. Then the mu-operator muy(g(x_1,...,x_n,y)=0) gives ...

Polynomials O_n(x) that can be defined by the sum O_n(x)=1/4sum_(k=0)^(|_n/2_|)(n(n-k-1)!)/(k!)(1/2x)^(2k-n-1) (1) for n>=1, where |_x_| is the floor function. They obey the ...

A relation "<=" is a partial order on a set S if it has: 1. Reflexivity: a<=a for all a in S. 2. Antisymmetry: a<=b and b<=a implies a=b. 3. Transitivity: a<=b and b<=c ...

A partially ordered set (or poset) is a set taken together with a partial order on it. Formally, a partially ordered set is defined as an ordered pair P=(X,<=), where X is ...

The number of partitions of n with k or fewer addends, or equivalently, into partitions with no element greater than k. This function is denoted q(n,k) or q_k(n). (Note that ...