largest integer power divisor of a number
The LargestNthPower(m, n) command computes the greatest positive integer b such that bn divides m.
Every positive integer is a divisor of 0, so there is no greatest positive integer b such that bn divides 0. For this reason, LargestNthPower(0, n) returns an error.
Error, (in NumberTheory:-LargestNthPower) there is no largest integer which, raised to the power k, divides 0
The greatest integer power divisor can be seen from the prime factorization.
The NumberTheory[LargestNthPower] command was introduced in Maple 2016.
For more information on Maple 2016 changes, see Updates in Maple 2016.
Download Help Document
What kind of issue would you like to report? (Optional)