This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Modular Arithmetic of Arbitrarily Long Sequences of Digits
December 1974 (vol. 23 no. 12)
pp. 1301-1303
B.W. Suter, Honeywell, Inc.
Some fundamental results in the area of computability theory are presented. These include the fact that a finite state machine can find the residue of an arbitrarily long sequence using any modulus and any radix. This leads to the consideration of using modular arithmetic on arbitrarily long sequences with a finite state machine. A finite state machine can perform modular addition, subtraction, multiplication, and, if defined, division of a pair of arbitrarily large numbers, using any modulus and any radix.
Index Terms:
Computability theory, computer arithmetic, modular addition, modular arithmetic, modular division, modular multiplication, modular subtraction, modulus, residue.
Citation:
B.W. Suter, "The Modular Arithmetic of Arbitrarily Long Sequences of Digits," IEEE Transactions on Computers, vol. 23, no. 12, pp. 1301-1303, Dec. 1974, doi:10.1109/T-C.1974.223850
Usage of this product signifies your acceptance of the Terms of Use.