Manual

402 Functions and commands
modgcd Uses the modular algorithm to return the greatest common
divisor of two polynomials.
modgcd(Poly1,Poly2)
Example:
modgcd(x^4-1,(x-1)^2) gives x-1
mRow Given an expression, a matrix, and an integer n, multiplies
row n of the matrix by the expression.
mRow(Expr, Matrix, Integer)
Example:
mRow returns
mult_c_conjugate If the given complex expression has a complex denominator,
returns the expression after both the numerator and the
denominator have been multiplied by the complex conjugate
of the denominator. If the given complex expression does not
have a complex denominator, returns the expression after
both the numerator and the denominator have been
multiplied by the complex conjugate of the numerator.
mult_c_conjugate(Expr)
Example:
mult_c_conjugate returns
mult_conjugate Takes an expression in which the numerator or the
denominator contains a square root. If the denominator
contains a square root, returns the expression after both the
numerator and the denominator have been multiplied by the
complex conjugate of the denominator. If the denominator
does not contain a square root, returns the expression after
both the numerator and the denominator have been
multiplied by the complex conjugate of the numerator.
mult_conjugate(Expr)
Example:
mult_conjugate returns
12
12
34
56
1





12 24
34
56
1
32i+
-------------------


132 i–+
32i+32 i–+
---------------------------------------------------------
32–
32–32+
32+
----------------------------------------------------------