Number TheorySuperchallengeOrders and Primitive Roots ShareOrders and Primitive Roots · Superchallenge problemHow many ordered pairs (a,b)(a, b)(a,b) of integers with 1≤a≤361 \le a \le 361≤a≤36 and 1≤b≤361 \le b \le 361≤b≤36 satisfy ab≡1(mod37)a^b \equiv 1 \pmod{37}ab≡1(mod37)?Check Show answer Walk through it step by step Practice more like this Review this concept