Number TheoryHardOrders and Primitive Roots ShareOrders and Primitive Roots · Hard problem333 is a primitive root modulo 171717. Find the exponent kkk with 1≤k≤161 \le k \le 161≤k≤16 such that 3k≡7(mod17)3^k \equiv 7 \pmod{17}3k≡7(mod17).Check Show answer Walk through it step by step Practice more like this Review this concept