Prove that for all integers m and n, ifm mod5=2 and n
Chapter 4, Problem 4.198(choose chapter or problem)
Prove that for all integers m and n, ifm mod5=2 and n mod5=1 thenmn mod 5=2.
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