college math question
posted by student .
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. :(
Respond to this Question
Similar Questions

math calculus please help!
l = lim as x approaches 0 of x/(the square root of (1+x)  the square root of (1x) decide whether: l=1 or l=0 or l=1 Let me make sure I understand the question. Do we have lim x>0 x/[sqrt(1+x)  sqrt(1x)] ? 
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 the … 
Math Help please!!
Could someone show me how to solve these problems step by step.... I am confused on how to fully break this down to simpliest terms sqrt 3 * sqrt 15= sqrt 6 * sqrt 8 = sqrt 20 * sqrt 5 = since both terms are sqrt , you can combine … 
pseudo code and flow charts
how can write a pseudo code and a flow charts to solve these? 
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). 
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 
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 
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? 
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  
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)?