For an integer b and a positiver integer a, let b mod a denote the remainder after the division of b by a.(Use the definition of remainder b=aq+r) Suppose b1 mod a = r1 and b2 mod a = r2. Let r = r1r2 mod a. Prove that (b1b2) mod a = r.