Let $m \ge 2$ be a composite integer. Prove that there are elements $[x]_m$ and $[y]_m$ of $\mathbb Z$/m $\mathbb Z$ with $[x]_m,[y]_m$ $\neq$ $[0]_m$, such that $[x]_m\cdot[y]_m=[0]_m$
So, I understand the question but I am unsure of the approach to writing the proof. For me, it makes it easier to visualize a computational problem first, such as, let $x=4$,$y=5$ in $\mathbb Z$/4 $\mathbb Z$.
I suppose the proof I want to write is similar to the computational approach, let $x=m$ and show that, for any value $y$ and any composite value $m \ge 2$, $[x]_m\cdot[y]_m=[0]_m$
Any thoughts or suggestions?