Let a and b be integers, not both 0. Show that there are infinitely many pairs x, y of
Chapter 7, Problem 4(choose chapter or problem)
Let a and b be integers, not both 0. Show that there are infinitely many pairs x, y of integers such that gcd(a, b) = ax + by.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer