Search Results for ""

The quotient of two polynomials p(x) and q(x), discarding any polynomial remainder. Polynomial quotients are implemented in the Wolfram Language as PolynomialQuotient[p, q, ...

The remainder R(x) obtained when dividing a polynomial p(x) by another polynomial q(x). The polynomial remainder is implemented in the Wolfram Language as ...

A quantity x>0, which may be written with an explicit plus sign for emphasis, +x.

A sequence {mu_n}_(n=0)^infty is positive definite if the moment of every nonnegative polynomial which is not identically zero is greater than zero (Widder 1941, p. 132). ...

A positive measure is a measure which is a function from the measurable sets of a measure space to the nonnegative real numbers. Sometimes, this is what is meant by measure, ...

A positive integer n is kth powerfree if there is no number d such that d^k|n (d^k divides n), i.e., there are no kth powers or higher in the prime factorization of n. A ...

Let S be a collection of subsets of a set X and let mu:S->[0,infty] be a set function. The function mu is called a premeasure provided that mu is finitely additive, countably ...

A relation "<=" is called a preorder (or quasiorder) on a set S if it satisfies: 1. Reflexivity: a<=a for all a in S. 2. Transitivity: a<=b and b<=c implies a<=c. A preorder ...

Each prime factor p_i^(alpha_i) in an integer's prime factorization is called a primary.

A primary ideal is an ideal I such that if ab in I, then either a in I or b^m in I for some m>0. Prime ideals are always primary. A primary decomposition expresses any ideal ...