I am trying to show that x^2 == 25(mod 997) has a solution, but I can't seem to get there.

Printable View

- Mar 30th 2010, 11:52 AMtarheelbornEuler's Criterion
I am trying to show that x^2 == 25(mod 997) has a solution, but I can't seem to get there.

- Mar 30th 2010, 12:56 PMBlack
x=5?

- Mar 30th 2010, 01:00 PMtarheelborn
Yeah, thanks. Caught onto that after I belatedly realized that 997 is prime. Thank you!

- Mar 30th 2010, 01:12 PMBruno J.
- Mar 30th 2010, 01:50 PMtarheelborn
But since 997 is prime, wouldn't Lagrange's theorem apply to show that there are ONLY 2 solutions?

- Mar 30th 2010, 02:51 PMtonio
- Mar 30th 2010, 02:57 PMtarheelborn