MathCastle
Number TheoryHardOrders and Primitive Roots

Orders and Primitive Roots · Hard problem

Find the order of 66 modulo 1111, that is, the smallest positive kk with 6k≡1(mod11)6^k \equiv 1 \pmod{11}.