MathCastle
Number TheoryHardOrders and Primitive Roots

Orders and Primitive Roots · Hard problem

Find the order of 2121 modulo 3131, that is, the smallest positive kk with 21k≡1(mod31)21^k \equiv 1 \pmod{31}.