MathCastle
Number TheoryHardOrders and Primitive Roots

Orders and Primitive Roots · Hard problem

How many xx with 0≤x<1430 \le x < 143 satisfy x2≡3(mod143)x^2 \equiv 3 \pmod{143}?