Natural Number Representation

(整数の表現)

Discrete Mathematics I

2nd lecture, September 23, 2016

http://www.sw.it.aoyama.ac.jp/2016/Math1/lecture2.html

Martin J. Dürst

AGU

© 2005-15 Martin J. Dürst Aoyama Gakuin University

Today's Schedule

 

Summary of Last Lecture

 

Last Week's Homework

 

Problems with Moodle Registration

 

How to Watch Videos

The video of the first lecture is available via a link from Moodle.

The video plugin/application is widely supported. Please contact me if you have problems with your OS or browser.

Userid and password are available on the Moodle course page.
They are the same for all students, but only for students of this lecture!

Please use the video soon to review the lecture.
Please be careful when watching the video on a mobile device (may be expensive!).

The video can be watched at different speeds, and you can jump easily to the next slide.

 

History of Numbers and Numerals

(Georges Ifrah: The Universal History of Numbers, John Wiley & Sons, 1998)

 

The Shape of Numerals

 

Creating the Natural Numbers Starting with 1

Peano Axioms (Guiseppe Peano, 1858-1932)

  1. 1 is a natural number
    (1∈ℕ)
  2. If a is a natural number, then s(a) is a natural number (s(a) is the successor of a)
    (a∈ℕ ⇒ s(a)∈ℕ)
  3. There is no natural number x so that s(x) = 1
  4. If two natural numbers are different, then their successors are different
    (a∈ℕ, b∈ℕ, abs(a) ≠ s(b))
  5. If we can prove a property for 1,
    and we can prove, for any natural number a, that if a has this property then s(a) also has this property,
    then all natural numbers have this property.

(Nowadays, it is usual to start with 0 rather than with 1.)

(We will learn how to express axioms 3 and 5 as formulæ in the lesson about Predicate Logic)

 

Number Representation using Peano Axioms

1 1
2 s(1)
3 s(s(1))
4 s(s(s(1)))
5 s(s(s(s(1))))
6 s(s(s(s(s(1)))))
7 s(s(s(s(s(s(1))))))
... ...

 

Addition using Peano Axioms

Axioms of addition:

  1. a + 1 = s(a)
  2. If a and b are natural numbers, a + s(b) = s(a + b)
    (a∈ℕ, b∈ℕ ⇒ a + s(b) = s(a + b))

Calculate 2 + 3 using Peano arithmetic:

 

Associative Law

(associative property)

A binary operation (represented by operator △) is associative if and only if for all operands a, b, and c:

(ab) △ c = a △ (bc)

Examples:

Counterexamples:

 

Proof of Associativity of Addition using Peano Axioms

What we want to prove:

Associative law for addition: (d + e) + f = d + (e + f)

Let's prove this for all values of f.

 

Comments on Proof

 

Comments on Axioms

 

The Discovery of 0

 

More Arithmetic Operations

Exponentiation (e.g. 23):

Two raised to the power of three is eight.

Two to the power of three is eight.

Two to the three (third) is eight.

The third power of two is eight.

Five to the power of four is six hundred twenty-five.

Three raised to the power of four is eight-one.

Modulo operation (remainder):

Twenty modulo six is two.

Twenty-five modulo seven is four.

 

Positional Notation: Decimal Notation

Number representations before positional notation:

Chinese (Han) numerals: 二百五十六、二千十六

Roman numerals: CCLVI, MMXVI

Example of decimal notation: 256 = 2·102 + 5·101 + 6·100

Example containing 0: 206 = 2·102 + 0·101 + 6·100

Generalization: dn...d1d0 = dn·10n+...+d1·101+d0·100

Example with decimal point: 34.56 = 3·101 + 4·100 + 5·10-1 + 6·10-2

 

Binary Numeral System

(the base of a number is often given as a subscript)

10100112 = 1·26 + 0·25 + 1·24 + 0·23 + 0·22 + 1·21 + 1·20 =

1·64 + 0·32 + 1·16 + 0·8 + 0·4 + 1·2 + 1·1 =

1·64 + 1·16 + 1·2 + 1·1 =

64 + 16 + 2 + 1 =

83

 

Base Conversion: Base b to Base 10

Calculate the sum of each of the digits multiplied by its positional weight.

The positional weight is a power of b, the zeroth power for the rightmost digit.

The power increases by one when moving one position to the left.

dn...d1d0 (in base b) = dn·bn+...+d1·b1+d0·b0

 

Base Conversion: Base 10 to Base b

Take the number to convert as the first quotient.

Repeatedly:

dividend divisor quotient remainder digits of the result
23←
23 2 11← 1 1
11 2 5← 1 11
5 2 2← 1 111
2 2 1← 0 0111
1 0 1 10111

23 divided by 2 is 11 remainder 1

11 divided by 2 is 5 remainder 1

5 divided by 2 is 2 remainder 1

2 divided by 2 is 1 remainder 0

1 divided by 2 is 0 remainder 1

23 = 11·21 + 1·20
= 5·22 + 1·21 + 1·20
= 2·23 + 1·22 + 1·21 + 1·20
= 1·24 + 0·23 + 1·22 + 1·21 + 1·20 = 10111

Using Horner's rule: 23 = (((1×2 + 0)×2 + 1)×2 + 1)×2 + 1

 

Base Conversion: Base 10 to Base b (second method)

dividend divisor quotient remainder digits of the result
23←
23 16 1 7← 1
7 8 0 7← 10
7 4 1 3← 101
3 2 1 1← 1011
1 1 1 0← 10111

 

Base Conversion: Base b to Base c

 

Base Conversion Shortcut Example

Convert 47623 (base 8) to base 4.

8 = 23, 4 = 22, therefore convert base 8 → base 2 → base 4

476238

4 7 6 2 3 base 8
100 111 110 010 011 convert each base-8 digit to three base-2 digits

1001111100100112

1 00 11 11 10 01 00 11 split base 2 into groups of two digits
1 0 3 3 2 1 0 3 convert two base-2 digits to one base-4 digit

→ 103321034

 

Hexadecimal Numbers

1AF = 1×162 + A×161 + F×160 = 1×256 + 10×16 + 15×1 = 256 + 160 + 15 = 431

Values of hexadecimal (base 16) digits
digit (upper case) digit (lower case) value (decimal)
A a 10
B b 11
C c 12
D d 13
E e 14
F f 15

 

Bases Frequently Used in IT

base name (adjective) and abbreviation (reason for) use constants in programming languages
2 binary, bin used widely in logic and circuits (hardware) 0b101100 (Ruby,...)
8 octal, oct shortened form of binary (rare these days) 024570 (C and many others)
10 decimal, dec for humans 1234567 (all languages)
16 hexadecimal, hex shortened form of binary, 1 byte (8bits) can be represented with two digits 0xA3b5 (C and many others)

 

Correspondence between binary and hexadecimal numbers

10 2 16
0 0000 0
1 0001 1
2 0010 2
3 0011 3
4 0100 4
5 0101 5
6 0110 6
7 0111 7
8 1000 8
9 1001 9
10 1010 A
11 1011 B
12 1100 C
13 1101 D
14 1110 E
15 1111 F
16 10000 10

 

Powers of 2

n 2n in base 16
0 1 1
1 2 2
2 4 4
3 8 8
4 16 10
5 32 20
6 64 40
7 128 80
8 256 100
9 512 200
10 1'024 ≈103 (kilo) 400
11 2'048 (the game) 800
12 4'096 1000
16 65'536 1'0000
20 1'048'576 ≈ 106 (mega) 10'0000
30 1'073'741'824 ≈ 109 (giga) 4000'0000
40 1'099'511'627'776 ≈ 1012 (tera) 100'0000'0000

 

Homework: Jokes

Question: Why do computer scientist always think Christmas and Halloween are the same?
(Hint: In the USA, Halloween is October 31st only)

Question: At what age do Information Technologists celebrate "Kanreki" (還暦)

 

This Week's Homework

 

今週の宿題

 

Glossary

number
numeral
数字
natural number
自然数
discovery
発見
origin
原点
positional notation
位取り表現
perfect score
満点
confusion
混乱
representation
表現
exponentiation
べき乗演算
Modulo operation
モジュロ演算
remainder
剰余 (余り)
decimal notation (decimal numeral system)
十進法
Chinese numerals
漢数字
Roman numerals
ローマ数字
discovery
発見
axiom
公理
Peano axioms
ペアノの公理
successor
後者
formula (plural: formulæ)
property
性質
arithmetic
算術
associative law (property)
結合律
counterexample
反例
operation
演算
operator
演算子
operand
被演算子
binary operation
二項演算
proof
証明
prove
証明する
Q.E.D. (quod erat demonstrandum)
証明終了
parenthesis
(丸・小) 括弧、複数 parentheses
mathematical induction
数学的帰納法
self-evident
自明
remainder
余り、剰余
subscript
下付き文字 (添え字)
generalization
一般化
decimal point
小数点
base
基数
base conversion
奇数変換
positional weight
(その桁の) 重み
dividend (or numerator)
被除数、実 (株の配当という意味も)
divisor (or denominator, modulus)
除数、法
quotient
商 (割り算の結果)
Horner's rule
ホーナー法
digit
数字
shortcut
近道
upper case
大文字
lower case
小文字
binary
二進数 (形容詞)
octal
八進数 (形容詞)
decimal
十進数 (形容詞)
hexadecimal
十六進数 (形容詞)
circuit
回路
constant
定数
joke
冗談
submit
提出する
proposition
命題
function
関数