MathCastle
ChallengeChallenge

Challenge · Challenge problem

What is the smallest positive integer nn such that n⋅2≡1(mod9)n \cdot 2 \equiv 1 \pmod{9}?

Practice more like this