Hi folks,(adsbygoogle = window.adsbygoogle || []).push({});

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?

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Solving Systems of Congruences when mods not pairwise relatively prime

Loading...

Similar Threads for Solving Systems Congruences |
---|

I Solving System of Equations w/ Gauss-Jordan Elimination |

I Solving a system of linear equations using back substitution |

I Matrix Equation -- clarification about solving a system |

I Can this matrix equation be solved? |

**Physics Forums | Science Articles, Homework Help, Discussion**