Study divisibility of integers


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.

MuPAD Functions

gcdGreatest common divisor of polynomials
gcdexExtended Euclidean algorithm for polynomials
igcdGreatest common divisor of integers and complex numbers with integer real and imaginary parts
igcdexExtended Euclidean algorithm for two integers
numlib::igcdmultExtended Euclidean algorithm for integers
ilcmLeast common multiple of integers
lcmLeast common multiple of polynomials
numlib::divisorsDivisors of an integer
numlib::numdivisorsNumber of divisors of an integer
numlib::OmegaNumber of prime divisors (with multiplicity)
numlib::sumdivisorsSum of divisors of an integer



Studying divisibility of integers by other integers is a common task in number theory.