MathCastle
Number TheoryEasyOrders and Primitive Roots

Orders and Primitive Roots · Easy problem

The number 33 is a primitive root modulo 77. Find the exponent kk with 0≤k≤50 \le k \le 5 such that 3k≡5(mod7)3^k \equiv 5 \pmod{7}.