Search Results for ""

A multiplication * is said to be right distributive if (x+y)z=xz+yz for every x, y, and z. Similarly, it is said to be left distributive if z(x+y)=zx+zy for every x, y, and ...

A quantity that is divided by another quantity.

A group set is a set whose elements are acted on by a group. If the group G acts on the set S, then S is called a G-set. Let G be a group and let S be a G-set. Then for every ...

Integer division is division in which the fractional part (remainder) is discarded is called integer division and is sometimes denoted \. Integer division can be defined as ...

The symbol separating the dividend from the divisor in a long division that is drawn as a right parenthesis (or sometimes a straight vertical bar) with an attached vinculum ...

A module homomorphism is a map f:M->N between modules over a ring R which preserves both the addition and the multiplication by scalars. In symbols this means that ...

A multiple of a number x is any quantity y=nx with n an integer. If x and y are integers, then x is called a factor of y. The smallest positive number m for which there exist ...

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

In general, a remainder is a quantity "left over" after performing a particular algorithm. The term is most commonly used to refer to the number left over when two integers ...