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