0
answers
0
watching
76
views
6 Nov 2019
Consider the following statement. Let n Z with n > 1, let m Z with m ge 1, and let a1, a2 ... am, b1, ..., bm integers. If a1 b1 (mod n), a2 = b2 (mod n), ... , am bm (mod n), then (mod n) Prove the statement by mathematical induction on m. Show transcribed image text
Consider the following statement. Let n Z with n > 1, let m Z with m ge 1, and let a1, a2 ... am, b1, ..., bm integers. If a1 b1 (mod n), a2 = b2 (mod n), ... , am bm (mod n), then (mod n) Prove the statement by mathematical induction on m.
Show transcribed image text