Bma 111 - Basic Mathematics Number Systerms: Φ Therefore, examples are
Bma 111 - Basic Mathematics Number Systerms: Φ Therefore, examples are
Bma 111 - Basic Mathematics Number Systerms: Φ Therefore, examples are
NUMBER SYSTERMS
This involves the numbers used in mathematics.
i. Natural Numbers
These are positive whole numbers i.e. 1, 2, 3, 4…
The set is denoted by IN
The set is also called counting numbers.
ii. Integers
These are whole numbers, positive and negative including zero. The set is
denoted by Z
Therefore
Z = Z- U Z+ U {0}
Therefore,
Z = {….., -2, -1, 0, 1, 2, 3, ….}
The set is infinite.
iii. Rational and irrational numbers
a
A rational number is any number which can be written in the form of where
b
a and b are integers, b ≠ 0 and the common divisor between a and b is 1.
The set is denoted by Φ
1 −1 13
Therefore, examples are , 3, ,
2 5 7
a
An irrational number is any number which cannot be written in the form of .
b
The set of irrational number is denoted by Φc.
Example of irrational numbers are;
IN C
→
ZC
→
Φ U Φc C
→
IR
Therefore the set of real numbers is the superset of all the others number
systems.
v. Complex Numbers
This is the set of numbers which can be written in the form Z= a+ ib where a
and b are real numbers, a is the real part of Z, b is the imaginary part of Z and
i =√ −1.
Recurring Decimals
These are decimals which endless recurring numbers after the decimal point.
Examples
4.22222….
0.323232….
5.000…….
Recurring decimals van be expressed as rational numbers.
Example.
Express 1..272727… as a rational number
Solution
Let
1.272727 = n ……………………… (i)
1.272727 = 100n …………………. (ii)
(ii) to (i)
127.272727 100n
1.272727 1n
126.000000 99n
136 14
n= =
99 11
Theorem
√ 2 is irrational. Proof
Proof
We prove by contradiction i.e. assume that √ 2 is rational.
a
√ 2= b
a2
2=
b2
Then
2b2 = a2 ………………. (i)
From (i) a2 and a are divisible by 2.
Therefore
Let a = 2p
Then
a2 = 4p2
Therefore
2b2 = 4 p2
Then
2 = 2p2 ……….. (ii)
From (ii) b and b are divisible by 2.
Since both a and b are divisible by 2 and we assumed that √ 2 is rational, this is
a contradiction therefore √ 2 must be irrational.
Theorem
√ 5 is irrational. Proof
Proof
We prove by contradiction i.e. assume that √ 5 is rational.
m
√ 5= n
m2
5= 2
n
Then
5n2 = m2 ………………. (i)
From (i) m2 and m are divisible by 5.
Therefore
Let m = 5k
Then
m2 = 25k2
Therefore
5n2 = 25 k2
Then
n2 = 5k2 ……….. (ii)
From (ii) n2 and n are divisible by 5.
Since both n and m are divisible by 5 and we assumed that √ 2 is rational, this
is a contradiction therefore √ 2 must be irrational.