|Sep25-11, 07:35 PM||#1|
Solving Systems of Congruences when mods not pairwise relatively prime
The CRT says there's a unique solution to the system of congruences
[itex] x = a [/itex] (mod m)
[itex] x = b [/itex] (mod n)
[itex] x = c [/itex] (mod p)
in (mod mnp) when [itex] m, n, p [/itex] are pairwise relatively prime. But what if [itex] m, n, p [/itex] are NOT pairwise relatively prime. Is there a systematic way to solve these cases?
|Sep27-11, 09:00 AM||#2|
The system may not have a solution if the moduli are not pairwise coprime.We can, of course,solve two equations at a time modulo the lcm & try to patch up the solutions... I don't know how to answer this best.
|Similar Threads for: Solving Systems of Congruences when mods not pairwise relatively prime|
|Prime & Congruences||Linear & Abstract Algebra||7|
|solving Congruences||Linear & Abstract Algebra||2|
|Quadratic congruences with prime modulus||Linear & Abstract Algebra||9|
|Solving polynomial congruences modulo a prime power||Calculus & Beyond Homework||0|
|systems of linear congruences||Introductory Physics Homework||4|