$I=(2,x)$ and $J=(3,x)$ be ideals.
$I\cdot J=(6,x)$.
Because $6=2\cdot 3$ and $x=3\cdot x-2\cdot x$, does this means that $I\cdot J$ contains $(6,x)$ or is it the inverse?
$I=(2,x)$ and $J=(3,x)$ be ideals.
$I\cdot J=(6,x)$.
Because $6=2\cdot 3$ and $x=3\cdot x-2\cdot x$, does this means that $I\cdot J$ contains $(6,x)$ or is it the inverse?
$IJ=(2\cdot 3,2x,3x,x^2)$. But $x=3x-2x\in IJ$, so $IJ=(6,2x,3x,x^2,x)=(6,x)$.
Expanding the product ideals below using ideal arithmetic (esp. distributive law)
yields $\,(2,x)(3,x) = (6,2x,3x,xx) = (6,x(\color{#c00}{2,3},x)) = (6,x)\,$ by $\,\color{#c00}{(2,3)=1}$
Generally, $ $ as for gcds, $ $ $(a,c)(b,c) = (ab,c(\color{#c00}{a,b,c})) = (ab,c)\,$ if $\,\color{#c00}{(a,b,c) = 1}$
Note on notation: when we view $\:\!\color{#c00}1\:\!$ an ideal (e.g. in above ideal equalities), we use the convention that this denotes the unit ideal $\:\!\color{#c00}{(1)}.\,$ This allows us to write proofs like above that work uniformly for both ideals and gcds, e.g. see these proofs of Euclid's Lemma (cf. comments below).