Get Math Help

GET TUTORING NEAR ME!

(800) 434-2582

By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy

    Home / Get Math Help

    Greatest Dividing Exponent

    Greatest dividing exponent

    IntegerExponent[n, b] = m for (n element Z and n>0 and b element Z and b>1 and m element Z and m>=0 and b^m<=n and n mod b^m = 0 and (not exists_(k, k element Z ∧ k>m)(b^k<=n ∧ n mod b^k = 0)))

    Back to List | POWERED BY THE WOLFRAM LANGUAGE