Unformatted text preview: = a 2 + b 2 . We have proven that there is a Euclidean algorithm in Z [ i ] as above. In the near future we will prove that there is a gcd for any given pair of elements. Now, the question: Find the greatest common divisor of 3 + 5 i and 2 + 3 i in Z [ i ]. Ferit ¨ Ozt¨urk, Bo˘gazi¸ci University 2008...
View Full Document
This note was uploaded on 05/04/2011 for the course MATH 321 taught by Professor Talinbudak during the Spring '11 term at BU.
- Spring '11