Question: For a, b, n Z+ and n > 1, prove that a = b (mod n) => gcd(a, n) = ged(b, n).

For a, b, n ∈ Z+ and n > 1, prove that a = b (mod n) => gcd(a, n) = ged(b, n).

Step by Step Solution

3.38 Rating (170 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Let g gcda n h gcd6 n ... 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 (8409).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!