Talk:Residue number system

From Wikipedia, the free encyclopedia

I removed this:

by multiplying the small integers together, modulo M, so shown here:

X = .

This isn't correct. For example if X = 2, you would get 2^N+1 from this, not just 2. The inversion procedure goes as on the Chinese remainder theorem page.

Charles Matthews 07:27, 16 Sep 2004 (UTC)

[edit] Chinese Remainder Theorem

Why is it the "Chinese" remainder theorem. Surely these properties have been discovered indepenently of China. While I think it is appropriate to have a Chinese remainder theorem page exploring the development of the concept in China, I believe there ought to be a more generic term for the concept.

It's the usual name. Policy is to take the common name as the article title, in most circumstances. Charles Matthews 19:27, 11 November 2005 (UTC)

[edit] Coprimeness of modulos

From the article: "The moduli must all be coprime; so in particular no modulus may be a factor of any other." These two sentences have different implications. 15 is not a factor of 21 and vice versa, but they are not coprime. If coprimeness is the requirement, the latter part should either be dropped or rephrased "in particular no modulus may share a factor with any other". If not dividing each other is the requirement, the former part should be dropped. (I'm pretty sure they need to be coprime, but I'd have to look it up to be sure.) 192.160.6.252 23:05, 17 March 2006 (UTC)