On Checking an Adder

It is widely known that a computer adder can be checked by a completely independent circuit using check symbols that are residues of the numbers modulo some base. This paper describes such a residue checking system and shows, moreover, that independent adding and checking circuits are possible only with systems of this type. The discussion includes a method of handling residue-class check symbols when overflow occurs.