HP Prime Graphing NW280AAABA ModgcdPoly1,Poly2, Modgcdx4-1,x-12 gives, MRowExpr, Matrix, Integer

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:

⎛		1 2	⎞
⎜	12,		⎟
mRow ⎜		3 4	, 1⎟ returns
⎜		5 6	⎟
⎝			⎠

1224

3 4

5 6

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	⎛	1	⎞	returns	1 ⋅ (3 + 2 ⋅ –i)
	⎝	3 + 2	⋅ i⎠		(3 + 2 ⋅ i) ⋅ (3 + 2 ⋅ –i)
		-------------------			--------------------------------------------------------

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 ( 3 – 2) returns	(--------3----–---------2-----)---⋅---(-----	--3-----+----------2---)
	3 +	2

402 Functions and commands