UNIVERSITY OF ILESA, ILESA, OSUN STATE, NIGERIA

DEPARTMENT OF MATHEMATICS

MTH 101: Elementary mathematics 1

NUMBER SYSTEM
All numbers are complex numbers.

Complex numbers can be sub-divided into:

The real numbers system comprises of rational numbers and irrational numbers.

Rational numbers are further divided into two major groups:

The integers are made up of zero, positive and negative whole numbers.

Non-integers are fractions.

This is represented diagrammatically as shown below:

1
 Complex
Numbers

Real Imaginary
Numbers Numbers

Rational Numbers
Irrational number
2 1 8 2 3
− , , , ,….. − 5, 2, π, … .
3 2 5 1

Fractions
Integars (that are not integars)
{..,-2,-2,0,1,2,..} 2 1 8 2
− , , , ,…..
3 2 5 1

Whole numbers Whole negative numbers

Counting numbers Zero

2
 PRINCIPLE OF MATHEMATICAL INDUCTION

If a statement 𝑃𝑛 (concerning an integer n) satisfies the following conditions for any positive
integral value of n:

(i) 𝑃𝑛 is true for n = 1 (or any positive value)

Then 𝑃𝑛 is true.

Illustrations:

𝑛(𝑛+1)
1. Prove that 1 + 2 + 3 + ⋯ + 𝑛 =
2

𝑛(𝑛+1)
Proof: Let Pn = 1 + 2 + 3 + ⋯ + 𝑛 =
2

For n = 1

Left Hand Side = 1

1(1+1)
Right Hand Side = =1
2

Therefore, Left Hand Side = Right Hand Side

Hence, the statement is true for n = 1

Now, let us assume that the statement is true for n = k

𝑘(𝑘+1)
i.e. 1 + 2 + 3 + ⋯ + 𝑘 =
2

For n = k + 1, add k + 1 to both sides

𝑘(𝑘+1)
1 + 2 + 3 + ⋯ + 𝑘 + (𝑘 + 1) = + (𝑘 + 1)
2

(𝑘+1)(𝑘+2)
=
2

(𝑘+1)[(𝑘+1)+1]
= 2

∴ If it is true for n = k, it has been proved here that it also is true for n = k + 1,

Therefore, it is true for all n. Hence Pn is true for all positive integers n.

3
 2. Show by induction that
𝑛(𝑛 + 1)(2𝑛 + 1)
12 + 22 + 32 + ⋯ + 𝑛2 =
6

𝑛(𝑛+1)(2𝑛+1)
Proof: let Pn = 12 + 22 + 32 + ⋯ + 𝑛2 =
6

For n = 1
Left Hand Side = 12 = 1
1(1+1)(2+1) 6
Right Hand Side = = =1
6 6

Therefore, Left Hand Side = Right Hand Side

Hence, the statement is true for n = 1

Now, let us assume that the statement is true for n = k

Then,

𝑘(𝑘 + 1)(2𝑘 + 1)
12 + 22 + 32 + ⋯ + 𝑘 2 =
6
For n = k + 1, add (𝑘 + 1)2 to both sides

𝑘(𝑘 + 1)(2𝑘 + 1)
12 + 22 + 32 + ⋯ + 𝑘 2 + (𝑘 + 1)2 = + (𝑘 + 1)2
6
𝑘(2𝑘+1)+6𝑘+6
= (𝑘 + 1) ( )
6

(𝑘+1)(2𝑘 2 +𝑘+6𝑘+6)
=
6

(𝑘+1)(𝑘+2)(2𝑘+3)
=
6

(𝑘+1)[(𝑘+1)+1][2(𝑘+1)+1]
=
6

∴ If it is true for n = k, it has been proved here that it also is true for n = k + 1,

Therefore, it is true for all n. Hence Pn is true for all positive integers n

4
Tutorial Questions

Use mathematical induction to prove that

1
1. 1.2.4 + 2.3.5 + ⋯ + 𝑛(𝑛 + 1)(2𝑛 + 1) = 12 𝑛(𝑛 + 1)(𝑛 + 2)(3𝑛 + 13)

2. 1 + 3 + ⋯ + (2𝑛 − 1) = 𝑛2
1 1 1 𝑛
3. + 2.3 + ⋯ + 𝑛(𝑛+1) =
1.2 𝑛+1
1
4. 13 + 23 + ⋯ + 𝑛3 = 4 𝑛2 (𝑛 + 1)2