 The corresponding conclusions about the Euclidean algorithm and its applications hold even for such polynomials.The Gaussian integers are complex numbers of the form , where and are ordinary integers and is the square root of negative one.By defining an analog of the Euclidean algorithm, Gaussian integers can be shown to be uniquely factorizable, by the argument above.