Share
Explore BrainMass

Mod

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

Solution Preview

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

$2.19