Which of the facts/claims were used to justify the Euclidian Algorithm? Choose all that apply. O There are infinitely many prime numbers. O If a product of two integers is divisible by a prime numbers, then one of these two integres must be divisible by a prime number. O If a, b are two positive integers, then we can always divide one by the other one with a remainder. O Any strictly decreasing sequence of nonnegative integers must terminate. O The GCD of two numbers does not change if we subtract a multiple of one of the numbers from the other number.

Which of the facts/claims were used to justify the Euclidian Algorithm? Choose all that apply. O There are infinitely many prime numbers. O If a product of two integers is divisible by a prime numbers, then one of these two integres must be divisible by a prime number. O If a, b are two positive integers, then we can always divide one by the other one with a remainder. O Any strictly decreasing sequence of nonnegative integers must terminate. O The GCD of two numbers does not change if we subtract a multiple of one of the numbers from the other number.

College Algebra

7th Edition

ISBN:9781305115545

Author:James Stewart, Lothar Redlin, Saleem Watson

Publisher:James Stewart, Lothar Redlin, Saleem Watson

Chapter3: Polynomial And Rational Functions

Section: Chapter Questions

Problem 6CC: When we divide a polynomial P(x) by a divisor D(x), the Division Algorithm tells us that we can...

See similar textbooks