While studying about the notion of gcd's in commutative rings, I came across a theorem which states that any two elements in a Euclidean Ring always have a gcd. While this is true, isn't this true for any arbitrary commutative ring with unit element say, R?
My definition of greatest common divisor is valid in case of a commutative ring only. It states that:
Let $R$ be a commutative ring and $a,b\in R.$ An element $d\neq 0\in R$ is said to be the greatest common divisor of $a$ amd $b$ if
$(i)$ $d|a$ and $d|b$ and
$(ii)$ if $\exists c\neq 0\in R$ such that $c|a$ and $c|b$ then we have, $c|d.$
For example, say, $a,b\in R$ where $R$ is now a commitative ring with unit element, then, we can surely say that $1|a,b$. If $\exists$ any $d$ satisfying $d|a,d|b$ such that for any $c|a,c|b$ we have $c|d$ then gcd of a and b is $d.$
If $1$ is the only element that divides both $a$ and $b$ then, gcd of $a$ and $b$ is $1,$ isn't it? Can someone please correct me if I am going wrong?