Saturday

April 19, 2014

April 19, 2014

Posted by **student** on Thursday, November 16, 2006 at 10:55am.

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. :(

**Related Questions**

Math - This is a problem concerning GCD. I need to prove gcd(a,b) = gcd(a,b+a). ...

math - (a). Is it true that for all set of positive integers a, b, c. gcd(a,c...

math - write each of the following as the ratio of two integers in lowest terms...

discrete math - If a and b are positive integers, prove that: ab = gcd(a,b)*lcm(...

pseudo code and flow charts - how can write a pseudo code and a flow charts to ...

coomon factors - I don't understand common factors. can someone show me how to ...

Math- Best Buy - In comparing prices of canned peaches, Darren finds that a 10-...

Math(Roots) - sqrt(24) *I don't really get this stuff.Can somebody please help ...

discrete math - If a and b are positive integers, prove that; ab = gcd(a,b)*lcm(...

Math - x-sqrt(2x+1) = 7 My answer: same as: x - 7 = sqrt(2x+1) ==> x^2 - 14x...