Given $m = 2n + 1$, what integer between 0 and $m$ is the inverse of 2 modulo $m$? Answer in terms of $n$.
Given m=2n+1, what integer between 0 and m is the inverse of 2(modm) Answer in terms of n.
2x≡1(modm) 2x≡1(mod2n+1) 2x−1=2n+1 2x=2n+2 x=n+1