MuPAD® notebooks will be removed in a future release. Use MATLAB® live scripts instead.
To convert a MuPAD notebook file to a MATLAB live script file, see
convertMuPADNotebook. MATLAB live scripts support most MuPAD functionality, although there are some differences. For more information, see
Convert MuPAD Notebooks to MATLAB Live Scripts.
|Greatest common divisor of polynomials|
|Extended Euclidean algorithm for polynomials|
|Greatest common divisor of integers and complex numbers with integer real and imaginary parts|
|Extended Euclidean algorithm for two integers|
|Extended Euclidean algorithm for integers|
|Least common multiple of integers|
|Least common multiple of polynomials|
|Divisors of an integer|
|Number of divisors of an integer|
|Number of prime divisors (with multiplicity)|
|Sum of divisors of an integer|
Studying divisibility of integers by other integers is a common task in number theory.