All Questions
1 question
7
votes
1
answer
723
views
Alternate algorithms for Chinese remainder theorem
I was teaching Discrete this semester and set the students loose on a system of linear congruences. One of them came up with this solution. Say $$ x \equiv 1 \textrm{ mod } 3 $$ $$ x \equiv 3 \textrm{ ...
- 82.7k