Number Theory: Divisibility
Many commands in this example worksheet are available at Maple's top level, meaning that no packages are required to be loaded. While any command in the Number Theory package can be referred to using the long form, for example, NumberTheory:-Divisors, it is often easier to load the package and then use the short form command names as well.
The greatest common divisor of two integers, m and n, is the largest positive integer that divides both numbers without a remainder. The top level igcd common computes the greatest common divisor of two numbers:
Another method for finding the gcd of two numbers is by using the extended Euclidean algorithm for integers, igcdex. This solves g = s⁢x+t⁢y = igcd⁡s,t.
The integer remainder of an integer, m, divided by n can be found using the irem command. The iquo command computes the integer quotient of m divided by n.
If the iquo command is called with an optional third argument that specifies a name, the result for the remainder is stored in the given name. The converse is also true for the irem command:
The Divisors command from the Number Theory package returns all divisors for an integer:
The SumOfDivisors command returns the sum of the divisors on an integer, including the integer:
Download Help Document
What kind of issue would you like to report? (Optional)