Go back to previous page
Forum URL: http://www.cut-the-knot.org/cgi-bin/dcforum/forumctk.cgi
Forum Name: College math
Topic ID: 80
Message ID: 1
#1, RE: Chinese Remainder Problem - a = b (mod 1) ?
Posted by alexb on Mar-31-01 at 01:17 AM
In response to message #0
LAST EDITED ON Mar-31-01 AT 01:18 AM (EST)

Steve, many thanks for your note. That statement is just plain wrong.

The congruence a = b (mod m) is equivalent to existence of integer t such that a = b + tm. If m = 1, this is true for any a and b (t being just the difference a - b.)

My apologies. Probably wrote that stupid remark much past midnight.

What is true is that a = b (mod 0) is equivalent to the customary a = b. But this is quite irrelevant in the context of the CRT.

Thank you again,
Alexander Bogomolny