Posted by student on Thursday, November 16, 2006 at 10:55am.
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],
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. :(
Answer this Question
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(...
college math - Prove: there exists x and y for c=ax+by iff gcd(a,b)/c.
coomon factors - I don't understand common factors. can someone show me how to ...
Math - 2. Find the LCM and GCD of (2y^2 - 3a^2)x + (2a^2 - 3x^2)y and (2a^2 + ...
pseudo code and flow charts - how can write a pseudo code and a flow charts to ...
math - How to find the GCD
math - Find the GCD OF 121, 151 And 211
programming language - can enyone help me figure this out... Surface to Volume ...
MATH HELP HELP HELP HELP HELP BOBOBOBOBOBOBOBOBOB - Let a = 349, M = 492186. ...