Help


from Wikipedia
« »  
* Every pair of congruence relations for an unknown integer x, of the form x ≡ k ( mod a ) and x ≡ l ( mod b ), has a solution, as stated by the Chinese remainder theorem ; in fact the solutions are described by a single congruence relation modulo ab.

1.836 seconds.