1 problem

Let $m$ be an integer and let $\hat{\mathcal{D}}$ be the $0$-crossing diagram of the unknot. A diagram of the unknot $\mathcal{D}$ has $n$ crossings if…