MathCastle
Number TheoryEasyOrders and Primitive Roots

Orders and Primitive Roots · Easy problem

Use Euler's criterion, (ap)≡a(p−1)/2(modp)\left(\dfrac{a}{p}\right) \equiv a^{(p-1)/2} \pmod p, to find the Legendre symbol (57)\left(\dfrac{5}{7}\right). (It equals 11 if 55 is a quadratic residue mod 77 and −1-1 if not.)