Successive Division Method Simulation

written by Teresa Carrigan

Run model in your browser



This model demonstrates the successive division method of converting a positive integer from decimal to another base, which is also known as the division-remainder method. You may choose any base in the range of two to sixteen.



First the model generates a random decimal number to convert to the specified base. The next step is to divide the decimal number by the base. The remainder becomes the right-most digit of the answer. Step three divides the quotient, again storing the remainder, even if it is zero. This process continues until the quotient is zero. The equivalent in the other base will have the same digits as the remainders, with the last remainder being the left-most digit. If the base is larger than 10, then some remainders will be larger than nine; they will have to be converted to their equivalent single digit character.


Applets on this website were written by Teresa Carrigan in 2004, for use in computer science courses at Blackburn College, with the exception of the Fireworks applet. The applets made with NetLogo require Java 1.4.1 or higher to run. The applets made with NetBeans require Java 1.4.2 or higher to run. Applets might not run on Windows 95 or Mac OS 8 or 9. You may obtain the latest Java plugin from Sun's Java site.