Explore BrainMass
Share

Explore BrainMass

    Discrete Proof of Divisibility

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    (See attached file for full problem description)

    ---
    Let d,m and n be positive integers with m>1 and m≡ 1 (mod d), let

    n= c0+mc1+m2c2+m3c3+...+mrcr

    be the base=m expansion of n, and let

    f = c0+c1+c2+c3+...+cr

    Prove that n is divisible by d if and only if f is divisible by d.
    ---

    © BrainMass Inc. brainmass.com October 9, 2019, 5:42 pm ad1c9bdddf
    https://brainmass.com/math/discrete-math/discrete-proof-divisibility-65115

    Attachments

    Solution Summary

    This is a discrete math proof of divisibility.

    $2.19