Solving quadratic congruences

[Shay10825]

1. The problem statement, all variables and given/known data

Hello everyone!

How would you solve a quadratic or nth degree congruence? For example how would I solve:


(x^2) + 2x -3 = 0 (mod 8 )


3. The attempt at a solution

I know this can be written like:

(x^2) + 2x = 3 (mod 8 ) but where would I go from here? and would I use the same approach for nth degree congruencies?

Thanks

[Dick]

I don't think there is any approach for nth degree congruencies. mod 8 there are only 8 candidates for x. I suggest you try them all.