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