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 and 49 is 1. I don't know what you mean by Q[sqrt(3)], nor the "integers of Q"

I can see why you are confused by the question. So am I. Are you sure you are stating it accurately? Perhaps if you explain what Q[sqrt(3)] is, someone can help you

I'm not sure if Euclid's algorithm is still valid for algebraic integers. If it is, then the GCD should be 1. If you use the rule:

GCD[a,b] = GCD[a, b Mod a],

you fund:

GCD[24,49] = GCD[24, 49 - 2*24] =
GCD[24,1] = 1

um... we notices that if just finding the GCD of 24 and 49, the answer is 1.

But here is about GCD of them in the integers of Q[sqrt(3)]. Are they the same?

Q mean quadratic integers. Quadratic integers are in the form of a+bsqrt(d). In here d=3.

Yes, I think it is different for algebraic numbers. I never studied this subject properly...

me too. I am taking the number theory , but the ending chapter is about quadratic integer. The lecture and book do not go in deep for this topic , but the questions are. :(

  1. 👍 0
  2. 👎 0
  3. 👁 191

Respond to this Question

First Name

Your Response

Similar Questions

  1. 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?

    asked by BECKY! on November 19, 2014
  2. 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

    asked by ELLA on November 18, 2014
  3. 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).

    asked by George on October 4, 2009
  4. discrete math

    If a and b are positive integers, prove that: ab = gcd(a,b)*lcm(a,b). Can visualize this being true and easily create examples just don't know how to prove algebraically. well the gcd of any two number can be found by multiplying

    asked by Rom on March 8, 2007
  5. math

    (a). Is it true that for all set of positive integers a, b, c. gcd(a,c) + gcd(b,c) = gcd(a + b,c). Explain (b) Is it true that there exist a set of positive integers a,b,c, such that gcd(a,c) + gcd(b,c) = gcd(a + b,c). Explain

    asked by excel on February 7, 2014
  6. 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

    asked by Mariaaaaaaa on January 29, 2017
  7. Math

    What is the inverse of 987x=1 (mod 11)? What I've done so far is: GCD(987, 11) 987 = 89 * 11 + 8 GCD(11, 8) 11 = 1 * 8 + 3 GCD(8,3) 8 = 2 * 3 + 2 GCD(3,2) 3 = 1 * 2 + 1 ...So basically, the GCD(987, 11) is 1. So... 1 = 3 - 2 = 3 -

    asked by Nora on March 24, 2015
  8. pseudo code and flow charts

    how can write a pseudo code and a flow charts to solve these? 1 to find the greatest common divisor out of two positive integers. 2 to find the smallest common factor out of two positive intrgers. Write the flow of thinking just

    asked by ravindu on June 8, 2007
  9. coomon factors

    I don't understand common factors. can someone show me how to find the greatest common factor of 385 and 1365? 385 = 5 x 7 x 11 1365 = 3 x 5 x 7 x 13 which factors are found in both? 5 x 7 so 35 is the HCF, (it's like taking the

    asked by kim on April 18, 2007
  10. math

    write each of the following as the ratio of two integers in lowest terms: 2 and 3/4 Any integer n can be written as n/1. If the ratio of two integers is in lowest terms then the greatest common divisor or gcd of them is 1. What is

    asked by need help on September 19, 2006

More Similar Questions