Scale of notation

Слайд 2

NNSU, 2006

Models and Methods of Programming

Positional, or radix notation

383 = 3*100+8*10+3*1 =

NNSU, 2006 Models and Methods of Programming Positional, or radix notation 383
3*102+8*101+3*100

Position of units

Position of hundreds

Position of tens

So, in decimal positional system we use 10 Arabic digits and write the number using powers of the number 10 which is called "radix" of the system.

Слайд 3

NNSU, 2006

Models and Methods of Programming

General positional scheme

Theorem. For any integer p>=2,

NNSU, 2006 Models and Methods of Programming General positional scheme Theorem. For
any positive integer number N may be represented in the form

N = βkpk + βk-1pk-1 + . . . + β2p2 + β1p1 + β0p0 (1)

where coefficients βi are integer and satisfy the inequalities 0<= βi <= p-1

Let's reduce the notation (1) and write the number N as the sequence of coefficients βi:
N = βk βk-1 . . . β2 β1 β0 (2)

The reduced form (2) is called positional representation of the number N in the number system notation with radix p.

Слайд 4

NNSU, 2006

Models and Methods of Programming

General positional scheme

If p<=10 all the coefficients

NNSU, 2006 Models and Methods of Programming General positional scheme If p
βi not greater than 9 and it is possible to use decimal digits from 0 to p-1 as digits in the p-radix system.
In this case we have got a simple rule to transform a number written in p-radix system to decimal one. We should just rewrite the number using the form (1) and calculate this expression.
Example.
Transform the number 4235 to the decimal system.
4235 = 4*52 + 2*51 +3*50 = 100 + 10 + 3 = 11310

Слайд 5

NNSU, 2006

Models and Methods of Programming

Overdecimal systems

However, if p>10 we may get

NNSU, 2006 Models and Methods of Programming Overdecimal systems However, if p>10
an ambiguity in the notation (2).
Let's consider p=16 (hexadecimal system) and take the number 30. We can write this number as
30 = 16+14 = 1*161 + 14*160
and with accordance of the rule (1) 30 = 11416 .Let's fulfill the reverse transformation: from hexadecimal system to decimal.
11416 = 1*162 + 1*161 + 4* 160 = 276 !!!
Where is the contradiction?
Only one digit may be placed in one position but we tried to put to the left position the number 14 of two digits. As a result the digit 1 which must be at the second position (on the left) has arisen at the third one and as a consequence have changed its value!

Слайд 6

NNSU, 2006

Models and Methods of Programming

Overdecimal systems

How to overcome this contradiction?
The

NNSU, 2006 Models and Methods of Programming Overdecimal systems How to overcome
decision is very simple. Let's add new signs to our decimal numerals so that signs will denote numbers 10, 11, 12 and so on. As these signs the uppercase Roman letters are used, i.e.
A=10, B=11, C=12, D=13, E=14, F=15. As in the informatics hexadecimal system is the greatest one it is not necessary to continue.
So, the number 3010 = 1E16
Example.
12312 = ?10 AAA16 = ?10

Слайд 7

NNSU, 2006

Models and Methods of Programming

Remainder method

The method of transforming a decimal

NNSU, 2006 Models and Methods of Programming Remainder method The method of
number to another system with radix being different from 10 can be derived from the expression (1): it is sufficient to find coefficients of powers. However, there is a simple method for sequential computation these coefficients.
Example. 11310 = ?5
113 5
10 22 5
13 20 4
10 2
3
Имя файла: Scale-of-notation-.pptx
Количество просмотров: 196
Количество скачиваний: 2