Number TheorySuperchallengeOrders and Primitive Roots ShareOrders and Primitive Roots · Superchallenge problemWhat is the smallest positive integer nnn such that 11n≡1(mod1000)11^n \equiv 1 \pmod{1000}11n≡1(mod1000)?Check Show answer Walk through it step by step Practice more like this Review this concept