You already know three notations for numbers:
Decimal (same as Base-10)
Tallies
Roman Numerals
You will learn a new kind of notation for numbers:
Positional Notation
Money in Toon Land
Base-n Notation
It only has symbols for the first ten values, including a symbol for zero. The only symbols in decimal are: 0 1 2 3 4 5 6 7 8 and 9.
Contrast this with Roman Numerals where 1 has the symbol I, but 10 has the symbol X, and 100 has the symbol C, and 1000 has the symbol M.
The reason that only ten symbols are needed (no matter how huge the number may be) is that the value contributed by a symbol depends on its position. The symbol is multiplied by its positional value.
Thus in the decimal number, 3257, the 3 is multiplied by a thousand, the 2 is multiplied by a hundred, the 5 is multiplied by ten, and the 7 is multiplied by 1 (namely not changed at all).
Compare the decimal number 1111 with the Roman numeral MCXI and note that the decimal number only uses one symbol (1) whereas the Roman numeral requires four symbols(M,C,X,I).
The positional values are powers of 10:
The Tally number system, simply makes a mark for each item being counted.
You have probably used the "Tally" number system when counting votes in a club election. One common method is to write down each candidate's name with space beside it and to make a mark beside the candidate each time he receives a vote. A refinement of the system is to make the fifth mark in a group at an angle through the others - making nice packets of five that can be more quickly counted.
Here are some decimal numbers and their translations into the Tally number
language:
The Tally number notation is actually a primitive precursor of base-5 notation, but it is not a positional notation.
To see the relation with the tally system consider the first three nonzero integers in both decimal and Roman numerals:
However, the value 4 is written using a "slick trick".
Roman numerals use the rule that a preceeding smaller valued symbol is subtracted from the resulting value rather than added. This is the positional feature mentioned above.
So the Roman numeral IV does not mean (1+5) but rather (-1+5).
You perhaps recall that each power of ten has its own symbol in Roman numerals:
Multiples of five also have their symbols, kind of like grouping by fives in the tally system.
As an example the Roman numeral:
A positional number notation makes the value contributed by a numeric symbol depend on its position, so that the same symbol can be used over and over for different values.
For example the same digit 2 used in each of the decimal numbers 200, 20, and 2 contributes a different value in each number.
Decimal notation and base-n notations are positional.
Tally notation is not positional.
Roman numerals are kind of both, since the I in IV means subtract one whereas the I in VI means add one. However the V has the same value in both IV and in VI. And, ten is not represented by I in a different position (as in decimal 10) but by a different symbol altogether(namely X).
So Roman numerals are not really a positional system.
So money in Toon Land has denominations that are based on groupings of six.
Here are the coins and paper money used in Toon Land:
Thus changing each of the denominations into pesos gives:
Not only is the money in Toon Land based on sixes, but the number notation is also based on sixes. Hence:
For example, if you had 3 mickeys, two freds, no plutos, 4 ducats,
and one peso, you would write down your money as:
Try to work out how many pesos this is in American:
So the grand total is 3888+432+0+24+1 = 4345 pesos.
Using the symbol * to mean multiply, the grand total can be written in "algebra" as:
This Toon Land number system is known to mathematicians as "base-6" numbers or hexary notation.
|
Base number
|
Spoken Name
|
Comments
|
|
2
|
binary
|
basic computer numbers
|
|
3
|
trinary
|
not very common
|
|
4
|
quadrary
|
even less common
|
|
5
|
qinary
|
kind of like a tally system
|
|
6
|
hexary
|
see Toon Land
|
|
7
|
septary
|
really wierd
|
|
8
|
octal
|
used in UNIX
|
|
9
|
nonary
|
about as strange as septary
|
|
10
|
decimal
|
you know this one
|
|
etc.
|
etc.
|
etc.
|
|
16
|
hexidecimal
|
do not confuse with hexary
|
|
Name
|
Radix
|
Digits Used
|
|
Binary
|
2
|
0 and 1
|
|
Trinary
|
3
|
0, 1, and 2
|
|
Quadrary
|
4
|
0, 1, 2, and 3
|
|
Octal
|
8
|
0, 1, 2, 3, 4, 5, 6, and 7
|
|
Decimal
|
10
|
0, 1, 2, 3, 4, 5, 6, 7, 8, and 9
|
|
Hexidecimal
|
16
|
0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
and also A, B, C, D, E, F |
The radix for a written number is often given as a subscript at the right end of the number.
Thus, for example, the notation 34158 is a number written in base-8 notation (namely in octal notation).
When the radix subscript is omitted, it often means that the number is written in decimal notation.
Draw a box labeled "radix". Beneath
that, draw a table of boxes with three columns and as many rows as there are
digit symbols in the given base-n number. Finally under the third column,
draw a box labeled "sum"
Here is an example calculation
(aka execution) of this algorithm for the notation 31246. The number
in decimal notation is the 700 in the "sum" box.
Draw three boxes labeled "radix",
"digit", and "res".
Here is an example calculation
(aka execution) of this algorithm for the notation 31246. The final
value recorded in each box is shown in black. The history of earlier values
is shown in magenta. Note that the computer only retains the most
recent recorded value in a box, so the magenta numbers are NO LONGER
in the computer. The number in decimal notation is the 700 in the "sum" box.
Draw a box labeled "radix" and a
box labeled "res". Beneath that, draw a table of boxes with two columns and
several rows. Leave space at the bottom of the table to add more rows if it
becomes necessary.
Here is an example calculation
(aka execution) of this algorithm to convert the decimal number 700 into a
base-6 notation. The base-6 number is the 31246 in the "res" box.
For example, if you long divide 14 into 54 you get a quotient of 3 and a remainder of 12.
Most calculators do NOT do long division.
Here is a "trick" for performing long division on an ordinary calculator
Letters of the alphabet are usually used for these additional symbols as follows:
When a remainder is obtained after long division by the radix, that remainder may be greater than 9. In that case record the corresponding digit symbol A (or B or C or etc) INSTEAD of the decimal value.
For example, long division of 14 into 54 gives a quotient of 3 and a remainder of 12. DO NOT record "1" and "2" as two separate symbols. INSTEAD, record "C" as a single digit symbol.
Draw four boxes labeled "radix",
"count", "res", and "work". The last box labeled "work" should be larger than
normal, since it will have long decimal point numbers in it.
Record a zero in the "count" box.
Here is an example calculation
(aka execution) of this algorithm to convert the decimal number 700 into a
base-6 notation. The base-6 number is the 31246 in the "res" box.
All but the last value in each box is shown in magenta. Notice how many calculations
are done in the "work" box - which is why it is drawn so large. It is almost too simple to be written formally as an algorithm.
BUT you will have to memorize the following table which gives the binary equivalent for every hexidecimal digit symbol.
|
Hex
|
Binary
|
Decimal
|
Hex
|
Binary
|
Decimal
|
|
|
0
|
0000
|
0
|
8
|
1000
|
8
|
|
|
1
|
0001
|
1
|
9
|
1001
|
9
|
|
|
2
|
0010
|
2
|
A
|
1010
|
10
|
|
|
3
|
0011
|
3
|
B
|
1011
|
11
|
|
|
4
|
0100
|
4
|
C
|
1100
|
12
|
|
|
5
|
0101
|
5
|
D
|
1101
|
13
|
|
|
6
|
0110
|
6
|
E
|
1110
|
14
|
|
|
7
|
0111
|
7
|
F
|
1111
|
15
|
Now imagine being given some number in hexidecimal notation. It will be a sequence of hex digit symbols (0,1,2,...9,A,B,...F).
Just replace each hex digit symbol by its corresponding 4 digit binary pattern as memorized above.
You can do this left to right, or right to left, or inside out, or whatever. Just make SURE you replace each hex (i.e hexidecimal) digit by the corresponding 4 bit pattern.
Group the bits into groups of four each - STARTING FROM THE RIGHT. If you run out of bits on the left, just add however many leading zero bits that you need.
Then replace each group of four bits by the corresponding hex digit symbol (0,1,2,...,9,A,B,...,F).
Provided you have memorized your powers of two, there is another algorithm for converting binary numbers to decimal ones. Set up a column of numbers that could have as many numbers as there are bits in the given binary number. Work through the binary number from right to left one bit at a time. While you are doing this, mentally work through the powers of two. Everytime you see a bit equal to 1, append the corresponding power of two (that is in your mind) onto the column of numbers. Everytime you see a bit equal to 0, just go on to the next bit and the next power of two. When you are all done, add up all of the powers of two you wrote down - that will be the decimal equivalent of the given binary number.
For example consider the binary number 1 0 0 1 0 1 1 1
In the table below , the bit being considered at each step will be shown as an X in the first column and the corresponding power of two will be in the second column.
|
1 0 0 1 0 1 1 X
|
1
|
|
1 0 0 1 0 1 X 1
|
2
|
|
1 0 0 1 0 X 1 1
|
4
|
|
1 0 0 X 0 1 1 1
|
16
|
|
X 0 0 1 0 1 1 1
|
128
|
Note that we skipped 8, 32, and 64 because those powers of two occurred while we were looking at a zero bit.
The final answer is 1+2+4+16+128 = 151
For the above reason and several others, you are expected to memorize the following table of powers of two:
|
0
|
1
|
|
8
|
256
|
|
1
|
2
|
|
9
|
512
|
|
2
|
4
|
|
10
|
1024
|
|
3
|
8
|
|
11
|
2048
|
|
4
|
16
|
|
12
|
4096
|
|
5
|
32
|
|
13
|
8192
|
|
6
|
64
|
|
14
|
16384
|
|
7 |
128 |
|
15 |
32768 |
|
|
|
16
|
65536
|
Copyright © 2001 Dr. James F. Wirth