Question: Let m, n e Z+ with gcd(m, n) = 1 and let a, b . Prove that a = b (mod m) and a =

Let m, n e Z+ with gcd(m, n) = 1 and let a, b ∈. Prove that a = b (mod m) and a = b (mod n) if and only if a = b (mod mn).

Step by Step Solution

3.13 Rating (163 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Proof If a b mod m then a b km for some k Z Likewi... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

954-M-L-A-L-S (8429).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!