| Thread Closed |
Solving quadratic congruences |
Share Thread | Thread Tools |
| Oct12-07, 06:21 PM | #1 |
|
|
Solving quadratic congruences
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 |
| PhysOrg.com |
science news on PhysOrg.com >> Hong Kong launches first electric taxis >> Morocco to harness the wind in energy hunt >> Galaxy's Ring of Fire |
| Oct12-07, 10:27 PM | #2 |
Recognitions:
|
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.
|
| Thread Closed |
| Thread Tools | |
Similar Threads for: Solving quadratic congruences
|
||||
| Thread | Forum | Replies | ||
| Solving a System of Congruences with A Changing Modulus | Linear & Abstract Algebra | 3 | ||
| Quadratic congruences with prime modulus | Linear & Abstract Algebra | 9 | ||
| Solving polynomial congruences modulo a prime power | Calculus & Beyond Homework | 0 | ||
| Solving a quadratic | General Math | 4 | ||
| Solving linear congruences | General Math | 1 | ||