MathCastle
Number TheoryHardOrders and Primitive Roots

Orders and Primitive Roots · Hard problem

33 is a primitive root modulo 1717. Find the exponent kk with 1≤k≤161 \le k \le 16 such that 3k≡7(mod17)3^k \equiv 7 \pmod{17}.