ChallengeChallenge ShareChallenge · Challenge problemWhat is the smallest positive integer nnn such that n⋅2≡1(mod9)n \cdot 2 \equiv 1 \pmod{9}n⋅2≡1(mod9)?Check Show answer Walk through it step by step Practice more like this