If gcd(m,n) = 1 is a given condition, how can you prove that the congruences x ≡ a (mod m) and x ≡ b (mod n) have a solution no matter what. Is there any example that shows that gcd(m,n) = 1 is a necessary condition?

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.3: Divisibility
Problem 30E: Let be as described in the proof of Theorem. Give a specific example of a positive element of .
icon
Related questions
Question

If gcd(m,n) = 1 is a given condition, how can you prove that the congruences x ≡ a (mod m) and x ≡ b (mod n) have a solution no matter what. Is there any example that shows that gcd(m,n) = 1 is a necessary condition?

Expert Solution
steps

Step by step

Solved in 4 steps with 24 images

Blurred answer
Recommended textbooks for you
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
Elementary Geometry For College Students, 7e
Elementary Geometry For College Students, 7e
Geometry
ISBN:
9781337614085
Author:
Alexander, Daniel C.; Koeberlein, Geralyn M.
Publisher:
Cengage,