Show that if a = b (mod m) and e = d (mod m), where a, b,
Chapter 3, Problem 3.4.20(choose chapter or problem)
Show that if a = b (mod m) and e = d (mod m), where a, b, e, d, and m are integers with m =:': 2, then a - e = b - d (mod m)
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer