a. Prove that if a and b are integers, not both zero, and d = gcd(a, b), then a/d and
Chapter 4, Problem 20(choose chapter or problem)
a. Prove that if a and b are integers, not both zero, and d = gcd(a, b), then a/d and b/d are integers with no common divisor that is greater than one. b. Write an algorithm that accepts the numerator and denominator of a fraction as input and produces as output the numerator and denominator of that fraction written in lowest terms. (The algorithm may call upon the Euclidean algorithm as needed.)
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