Title

Multiple-Length Division Revisited: A Tour of the Minefield

Author(s)/Creator(s)

Per Brinch Hansen, Syracuse University, School of Computer and Information ScienceFollow

Document Type

Report

Date

9-1992

Keywords

Algorithms, Multiple-length integer division

Language

English

Disciplines

Computer Sciences

Description/Abstract

Long division of natural numbers plays a crucial role in Cobol arithmetic, cryptography, and primality testing. Only a handful of textbooks discuss the theory and practice of long division, and none of them do it satisfactorily. This tutorial attempts to fill this surprising gap in the literature on computer algorithms. We illustrate the subtleties of long division by examples, define the problem concisely, summarize the theory, and develop a complete Pascal algorithm using a consistent terminology.

Additional Information

School of Computer and Information Science, Syracuse university, SU-CIS-92-19

Author later published: Per Brinch Hansen. 1994. Multiple-length division revisited: a tour of the minefield. Softw. Pract. Exper. 24, 6 (June 1994), 579-601. DOI=10.1002/spe.4380240605 http://dx.doi.org/10.1002/spe.4380240605

Recommended Citation

Hansen, Per Brinch, "Multiple-Length Division Revisited: A Tour of the Minefield" (1992). Electrical Engineering and Computer Science - Technical Reports. 166.
https://surface.syr.edu/eecs_techreports/166

Source

local