Explore BrainMass

Explore BrainMass

    Proving the Mod

    Not what you're looking for? Search our solutions OR ask your own Custom question.

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

    Prove that:
    if bd= bc (mod p) where p is a prime (and p does not divide b) , then d= c (mod p).

    © BrainMass Inc. brainmass.com March 4, 2021, 6:13 pm ad1c9bdddf
    https://brainmass.com/math/basic-algebra/proving-mod-35172

    Solution Preview

    Sol: bd = bc (mod p) implies that bc = bd + pk, where k is any integer.
    Dividing throughout by b, c = d + ...

    Solution Summary

    The solution assists with proving the mod.

    $2.49

    ADVERTISEMENT