DISCRETE MATHS

posted by .

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

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. college math question

    Find the GCD of 24 and 49 in the integers of Q[sqrt(3)], assuming that the GCD is defined. (Note: you need not decompose 24 or 49 into primes in Q[sqrt(3)]. Please teach me . Thank you very much. The only integer divisor of both 24 …
  2. Math

    This is a problem concerning GCD. I need to prove gcd(a,b) = gcd(a,b+a). I always get like like halfway then hit a roadblock (e.g. i can prove gcd(a,b) <= gcd(a,b+a) but not gcd(a,b) >= gcd(a,b+a).
  3. Discrete Math

    I know how to apply Euclidean algorithm when a is greater then b, but I'm not quite sure what to do when b is greater than a. For example a = 111 and b = 201. How do I solve this?
  4. Quantum Physics

    In this problem, we will carry out some steps of the quantum factoring algorithm for N = 15 (a) What is the period k of the periodic superposition set up by the quantum factoring algorithm if it chooses x = 2 ?
  5. physics

    n this problem, we will carry out some steps of the quantum factoring algorithm for N=15. (a) What is the period k of the periodic superposition set up by the quantum factoring algorithm if it chooses x=2?
  6. Quantum Computing

    In this problem, we will carry out some steps of the quantum factoring algorithm for N=21. (a) What is the period k of the periodic superposition set up by the quantum factoring algorithm if it chooses x=2?
  7. Math (Discrete Math)

    find the least positive integer N so that 1<gcd(N, 271) < gcd(N, 2014). Explain how you find N. Thanks for your help
  8. math

    GCD (24,20) IS 4. sINCE gcd(4,12 ) is 4 then GCD (24,2012 IS 4 USE Euclidem LGERITHM TO FIND THE gcd 722, 2413,209
  9. math!

    GCD (24,20)IS 4. sINCE gcd (4,12) IS 4, THEN gcd (24,20,12) is 4. use this approach and the euclidean algorithim to find the GCD ( 722, 2413,209) WHAT IS THE gcd?
  10. Discrete math

    (a) Use the Euclidean Algorithm to nd gcd (2017; 271) and use this to nd integers x and y so that gcd(2017; 271) = 2017x + 271y. (b) Is it true that for all integers a and b, if not both a and b are zeros then not both 5a+3band3a+2barezeros,andgcd(5a+3b;3a+2b)=gcd(a;b)?

More Similar Questions