Posted by **Don** on Friday, October 4, 2013 at 8:49am.

Use the Euclidean Algorithm to find gcd(112,15)

## Answer this Question

## Related Questions

- math! - GCD (24,20)IS 4. sINCE gcd (4,12) IS 4, THEN gcd (24,20,12) is 4. use ...
- math - GCD (24,20) IS 4. sINCE gcd(4,12 ) is 4 then GCD (24,2012 IS 4 USE ...
- Discrete Math - I know how to apply Euclidean algorithm when a is greater then ...
- college math question - Find the GCD of 24 and 49 in the integers of Q[sqrt(3...
- physics - n this problem, we will carry out some steps of the quantum factoring ...
- Quantum Physics - In this problem, we will carry out some steps of the quantum ...
- Math (Discrete Math) - find the least positive integer N so that 1<gcd(N, 271...
- Quantum Computing - In this problem, we will carry out some steps of the quantum...
- Math - This is a problem concerning GCD. I need to prove gcd(a,b) = gcd(a,b+a). ...
- discrete math - If a and b are positive integers, prove that: ab = gcd(a,b)*lcm(...