A Multivariable Chinese Remainder Theorem

arXiv1206.5114MaRDI QIDQ6233884FDOQ6233884

Publication date: 22 June 2012

Abstract: Using an adaptation of Qin Jiushao's method from the 13th century, it is possible to prove that a system of linear modular equations a(i,1) x(i) + ... + a(i,n) x(n) = b(i) mod m(i), i=1, ..., n has integer solutions if m(i)>1 are pairwise relatively prime and in each row, at least one matrix element a(i,j) is relatively prime to m(i). The Chinese remainder theorem is the special case, where A has only one column.

Mathematics Subject Classification ID

Linear equations (linear algebraic aspects) (15A06) History of Chinese mathematics (01A25) Computer solution of Diophantine equations (11Y50)

This page was built for publication: A Multivariable Chinese Remainder Theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6233884)