Which of the facts/claims were used to justify the Euclidean Algorithm? Choose all that apply. The GCD of two numbers does not change if we subtract a multiple of one of the numbers from the other number. There are infinitely many prime numbers. Any strictly decreasing sequence of nonnegative integers must terminate. If a, b are two positive integers, then we can always divide one by the other one with a remainder. 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.