Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Short division

Numerical Algorithm

Short division is a pencil and paper method of dividing one number by another in which the working is compressed into a single compact tableau instead of being written out in full. It is an abbreviated form of long division: the products that long division writes beneath the dividend are left out, and each partial remainder is carried forward by writing it beside the next digit of the dividend. The result is a tableau shorter than its long division counterpart, though the saving depends on the person holding the intermediate multiplications in their head, which in practice limits the method to small divisors, commonly those up to twelve that memorised multiplication tables cover, although it can be adapted to larger ones. Short division copes with arbitrarily large dividends and can be continued past a decimal point to give a decimal quotient. Two variations are described alongside it: reducing a number to its prime factors by dividing in turn by successive primes, and a modulo form that keeps only the remainders and so serves as a divisibility test. The remainder-tracking form can be described as a deterministic finite automaton with one state for each possible remainder, which shows that the numbers divisible by a given divisor form a regular language.

Facts
Problem Solved
Finding what number times the divisor equals the dividend 1
Sources
1. TheMathPage: Short division (Skill in Arithmetic, Lesson 12)
TheMathPageLesson 12, introduction
Quote, Lesson 12, introduction
The problem of division is to find what number times the Divisor will equal the Dividend.
View the Source
Short division (Wikipedia)
In Group: Number Theory and Primality, Lead, division algorithm
Quote, In Group: Number Theory and Primality, Lead, division algorithm
short division is a division algorithm which breaks down a division problem into a series of easier steps
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.