MathCastle
Number TheoryChallengeOrders and Primitive Roots

Orders and Primitive Roots · Challenge problem

Find the sum of all primes p<50p < 50 for which x2≡−1(modp)x^2 \equiv -1 \pmod p has a solution.