My book is going over finding the GCD[x,y] in the integers of some Q[Sqrt(d)].
One example states: Find the GCD of 24 and 49 in the integers of Q[Sqrt(3)]. It states that GCD is already assumed as defined and there is no need to decompose 24 or 49 into primes in Q[Sqrt(3)]].
Can anyone help me find this?
Thank you, -Samson