HP Prime Graphing Wireless Calculator - Manual (Page 199)

Functions and commands 195
MINREAL Returns the minimum real number (closest to zero) that the HP
Prime calculator is capable of representing in Home and CAS
views:
In the CAS, MINREAL=2.22507385851*10
-308
In Home view, MINREAL=1 E-499
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
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
conjugate of the numerator.
mult_conjugate(Expr)
12
1 2
3 4
5 6
1 , ,
 
 
 
 
 
12 24
3 4
5 6
1
3 2 i ⋅ +
-------------------
 
  1 3 2 i – ⋅ + ( ) ⋅
3 2 i ⋅ + ( ) 3 2 i – ⋅ + ( ) ⋅
---------------------------------------------------------