Prove that for any integers x and y, (x # y) mod n = (x
Chapter 5, Problem 7(choose chapter or problem)
Prove that for any integers x and y,
\((x \cdot y) \ \mathrm {mod} \ n = (x \ \mathrm {mod} \ n \cdot y \ \mathrm {mod} \ n) \ \mathrm {mod} \ n\)
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