Reputation
Top tag
Next privilege 250 Rep.
View close votes
Badges
3
Newest
 Supporter
Impact
~236 people reached

  • 0 posts edited
  • 0 helpful flags
  • 2 votes cast
Dec
23
awarded  Supporter
Jun
9
awarded  Editor
Jun
9
revised Solve a system of linear congruences
added 578 characters in body
Jun
9
comment Solve a system of linear congruences
You turn the left hand side into Smith normal form over the integers, not mod p. The resulting equations will look like a x = b mod p after the left hand side has been diagonalized. The equations are easily solvable. I'll also complement my answer to include the case of more than one modulus.
Jun
6
awarded  Teacher
Jun
6
answered Solve a system of linear congruences