Solving linear equations using residue arithmetic — Algorithm II

In a previous paper, which appeared in two parts, Algorithm I was described. (See 1] and 2] for details). Algorithm II differs from Algorithm I in that the Chinese Remainder Theorem is not used whenever it is necessary to reconstruct a unique integer from its residue representation. Instead, the residue representation is converted to asymmetric residue representation and then the symmetric residue representation is converted to its associatedsymmetric mixed-radix representation, from which the unique integer can be reconstructed in an easy manner. This procedure has advantages over the procedure using the Chinese Remainder Theorem.