Quadratic Congruences Mod 8: How to Solve?

  • Thread starter Thread starter Shay10825
  • Start date Start date
  • Tags Tags
    Quadratic
Shay10825
Messages
337
Reaction score
0

Homework Statement



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 )


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
 
Last edited:
Physics news on Phys.org
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.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top