Basic Mathematics Course Overview
Basic Mathematics Course Overview
BY SANDRAH HAPPINESS
MAIRINAI ZAKAYO
PHILIPO
KENYATTA UNIVERSITY
In this module, we shall look at counting techniques in mathematics; introduce you to set theory
propositional logic, methods of proof and complex numbers.
We hope that you will find this module exciting, educative, and engaging.
MAIRINAI ZAKAYO
PHILIPO
ii
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
Mmjjjjjjhggsjsjjsjsjjsjsjdjsjnmmmm
Bbbbnnnnnnnn
EDUCATION. 0793394796
mmmmmmmmmm
BASIC MATHEMATICS FLOW CHART
WEEK TOPIC
WEEK 9 LOGIC
REGARDS;LECTOR ABUYA
This lesson is intended to help you acclimatize to blended learning and to create a community of
learners who will motivate each other during the course. You will be required to introduce yourself
to your lecturer and colleagues either physically during a face to face session or even online before
other academic interactions start.
In this first lesson, we will introduce you to various methods of solving quadratic equations and
inequalities. The purpose of this lesson is to help you establish and apply the relationship between
roots and coefficients of quadratic equations.
iii
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Week 3 & 4: Permutations and Combinations
In this lesson, we introduce you permutations and combinations. Permutations and combinations
are very useful tools for counting in Mathematics.
This lesson considers Binomial Theorem and its applications. This Theorem gives a new way of
obtaining coefficients in binomial expansion as opposed to the use of the classical Pascal’s
Triangle method.
Week 9: Logic
In this lesson you will be introduced to propositional logic. The main emphasis will be
determination of truth values of logical statements. Logical statements have truth value either
TRUE or FALSE but not both.
Having studied logic in week 9, we will go a step further in this lesson to consider methods of
proof in Mathematics. We will consider both direct and indirect proofs.
In weeks 7 and 8, you were introduced to sets. In this lesson we will study one particular set called
the set of complex numbers. We will introduce you to arithmetic operations of these numbers,
their polar representation and De Moivere’s Theorem.
MAIRINAI ZAKAYO
iv
PHILIPO
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Week 13 &14: Examination
These two weeks bring together the work you have been doing to an end. This course unit will be
examined and will partially contribute to the award of the degree in the programme that you are
undertaking.
Lector abuya
The purpose of this module is to equip students with basic mathematical skills which build the
foundation of Mathematics.
ii) State and apply the Remainder Theorem and the Factor Theorem
iii) Differentiate permutations and combinations and apply them in counting iv) Perform set
operations and apply set theory to counting
vi) Prove mathematical statements using direct proof, contradiction, contraposition and
induction. vii)State and apply De Moivere’s Theorem.
COURSE DESCRIPTION
Quadratic equations and inequalities. Remainder and Factor Theorem and their applications.
Permutations and combinations, Binomial theorem and its applications. Set theory: Basic
operations on sets, Laws of set theory, Venn diagrams and application. Logic: Propositions,
compound propositions and truth tables. Methods of proof: Direct, indirect, Induction,
contradiction, cases, counter examples. Complex numbers: Arithmetic operations, Geometric
representations and polar form. De Moiver’s Theorem and its applications.
MAIRINAI ZAKAYO v
PHILIPO
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
COURSE REQUIREMENTS
This is a blended learning course that will utilize the flex model. This means that learning materials
and instructions will be given online and the lessons will be self-guided with the lecturer being
available briefly for face to face sessions and support and also on-site (online) most of the time.
You are advised to follow the topic flow-chart given so that you cover at least a lesson every week.
You will be required to participate and interact online with your peers and the e-moderator who
in this case is your lecturer. Guidelines for the online activities (which we shall keep referring to
as e-tivities) will be provided whenever there is an e-tivity. Please note that since the online
etivities are part of the learning process, they may be graded at the discretion of your e-moderator.
Such grading will however be communicated in the e-tivity guidelines and feedback given as soon
as possible after the e-tivity. The e-tivities will include but will not be limited to online assessment
quizzes, assignments and discussions. There are also assessment questions that you can attempt at
the end of every lesson to test your understanding of the lesson. The answers to all the assessment
questions are at the end of the module after lesson 8. All the resources that have been used in this
module in form of books are available under the resources section after the answers to the
questions.
ASSESSMENT
It is important to note that the module has embedded certain learner formative assessment
feedback tools that will enable you gauge your own learning progress. The tools include online
collaborative discussions forums that focus on team learning and personal mastery and will
therefore provide you with peer feedback, lecturer assessment and self- reflection.
I wish you the very best of experiences in this course.
Lector Abuya.
TABLE OF CONTENTS
TABLE OF CONTENT..............................................................................................................vii
LESSON ONE................................................................................................................................1
1.1 Introduction..............................................................................................................1
vi
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
1.2 Learning Outcomes..................................................................................................1
1.4 References..............................................................................................................12
LESSON TWO.............................................................................................................................13
2.1 Introduction............................................................................................................13
2.4 References..............................................................................................................20
LESSON THREE.........................................................................................................................22
3.1 Introduction............................................................................................................22
3.4 References..............................................................................................................32
LESSON FOUR...........................................................................................................................33
4.1 Introduction...........................................................................................................33
4.4 References……………………………..................................................................42
LESSON FIVE.............................................................................................................................43
SET THEORY..............................................................................................................................43
5.1 Introduction............................................................................................................43
LESSON SIX................................................................................................................................62
LOGIC..........................................................................................................................................62
6.1 Introduction............................................................................................................62
6.4 References…………………..................................................................................77
LESSON SEVEN.........................................................................................................................78
METHOD OF PROOF................................................................................................................78
7.1 Introduction............................................................................................................78
7.4 References…..........................................................................................................86
LESSON
EIGHT..........................................................................................................................87
COMPLEX NUMBERS..............................................................................................................87
8.1 Introduction............................................................................................................87
8.4 References………………………........................................................................108
ANSWERS..................................................................................................................................109
RESOURCES.............................................................................................................................111
MAIRINAI ZAKAYOviii
PHILIPO
LESSON ONE
1.1 Introduction
In this lesson we discuss quadratic equations and inequalities. In Mathematics we sometimes need
to use quadratic equations and inequalities to solve word problems. The most important thing when
solving these types of problems is to make sure that they are set up correctly so we can use the
quadratic equation and inequalities to easily solve them.
i) Solve quadratic equations using factorization, completing square and quadratic formula. ii)
Solve quadratic inequalities
A quadratic equation is an equation of the form ax2 bx c 0 , where a, b and c are real numbers
and a 0.
1.2.1.1 Methods of solution
Example 1.1
Solution
Look for two numbers a and b such that a b 5 and a b 6 , take a 6 and b 1.
Therefore we can write
2x2 5x 3 2x2 6x x 3 0
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
2x x 3 x 3 0
2x 1 x 3 =0
Either 2x 1 0 or x
3 0
x 12 or x 3.
NB
Reverse
x 3 0 or 2x 1 0
x 3 2x 1 0
x2 x2 3x 32 0
2x2 x 6x 3 0 or 2x2 5x 3 0.
Example 1.3
Solution
x2 65 x 25 0
Or x2 65 x 25
MAIRINAI
.
ZAKAYO
1 PHILIPO, FOR
DELEGATE
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
sides, x2 65 x 35 2 = 25 35 2 25 925
1925.
x 35 2
1925.
Taking the square root on both sides,
19 19
x 3 = .
5 25 5
3 19
x
5
x or x .
Example 1.4
Solution
x2 ba x ca 0
Or x2 ba x ca
2
Complete the square by adding b on both
sides, 2a
MAIRINAI ZAKAYO 2
PHILIPO
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
x b2 4ac
2a 2a
b b2 4ac
x
2a
x2 ba x ca 0 i)
or x .
Therefore,
MAIRINAI
3 ZAKAYO PHILIPO,
THE DELEGATE
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
x 0 or x
0 x x
0 x x
x 0
x2 x x 0 or
Or .
x2 x 0 ii)
and
c
.
a
Example 1.5
Write down the sums and products of the roots of the following equations;
i) 3x2 2x 7 0
ii) 2x x 1 x
7 iii) 2x2 5x 1
Solution
i) b 2 2 and c 7
a 3 3 a 3 ii) and iii) Exercise
Example 1.6
4
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
2 2
i) ii)
3 3
iii)
Solution
2 2 2
i) 2
2 2 2
2
2 2 2
ii) 2
2 2
2
2 2 from part i)
4 .
iii) 3 3 3 2 3 2 3
3 3 2 2 3
3 3
3
3
3 3 3
3 .
Example 1.7
The roots of the equation 3x2 4x 5 0 are and . Find the equation whose roots are
1 1
i) and
2
ii)
2
and
Solution
b 4
Sum: a
3
5
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
c 5
Product:
a
1 3 4
i) Sum: 1 45 5
3
and
1 1 3
Product: 1
5
4 3
i.e. x2 x 5 =0
5
i. or
5x2 4x 3 0 .
2 2 2
ii) Sum: 2
2
34 2 35 = 496
Product: 2 2 2 35 2 295
6
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Purpose To expose you to the relationship between roots and
coefficients of quadratic equations.
Brief summary of overall task Watch the video on Sum and product of roots of
quadratic equations by Mathusay Math Tutorial and then
give the formula for the sum and product of roots of
quadratic equations in terms of equation’s coefficient
Spark
are;
1 1
i) and
ii) 2 and 2
Interaction begins • Post your answers on the discussion forum 1.2.1
Read what your colleagues have posted.
• In a sentence or two, comment on what two of
your colleagues have posted keeping netiquette in
mind
7
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
1.2.2 Quadratic Inequalities
A quadratic inequality is an inequality in which one side is a quadratic polynomial and the other
side is zero.
Eg. 2x2 x 6 0
Consider the quadratic equation ax2 bx c 0 . Now, if b2 4ac 0 , then this equation has two
distinct real roots. Let the roots be and with . Then this equation can be written as
ax2 bx c a x x . 1
Next consider the number line below;
x x x
Then values of the factors in equation 1 in the three regions on the number line above are as
shown in the table below.
x x x x
x Negative Negative Positive
bx c 0 when x .
Example 1.8
8
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Solution
2x2 5x 3 2 x 3 x 12 and a 2 0,
x 3 x 12
2 x 3 x 12
x 3 Negative Negative Positive
or when x 12 .
Example 1.9
x 13 x 1
x 3 x
13 x 1 13 x 1
x 13 Negative Negative Positive Negative
9
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
1 x Positive Positive Positive Negative
1
Thus 3 x 13 x 0 when x 13 or x 1 . That is 1 2x 3x2 0 when x 13 or
x 1.
Steps
Example 1.10
Solution
x2 2x 8 0
Na MAIRINAI
x 4 x 2
PHILIPO
0 x 4 or x
x 6 -4 x 0 2 x 4
Consider any point less than 4 , say x 6 then
x 4 x 2 6 4 6 2 2 8 16 0
10
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
x 4 x 2 0 4 0 2 4 2 8 0
x 4 x 2 4 4 4 2 8 2 16 0
Hence the solution to the inequality x2 2x 8 0 is the set of all x such that either x 4 or x
2.
Na MAIRINAI ZAKAYO 11
PHILIPO
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
E-moderator interventions • Focussing group discussion
• Encouraging lurkers (quiet ones) to contribute
• Providing feedback/ teaching points
1 1
a) 2 2
b) c) 1 1
2. Prove that if one root of ax2 bx c 0 is twice the other, then 2b2 9ac .
3. The sum of the squares of the roots of ax2 bx c 0 is 1, prove that b2 2ac a2 . 4.
Find the set of all values of x for which
a) 6 x 12x2
b) x2 2x 15 0
1.4 References
1. Backhouse, J. and Houldsworth, S. (1985). Pure Mathematics Book I, Longman Publishers
Ltd.
2. Bostock, L., Chandler, S. and Rourke, C. (1982). Further Pure Mathematics. Stanley
Thornes Publishers Ltd.
LESSON TWO
Na MAIRINAI ZAKAYO
12 PHILIPO,
THE 20TH DELEGATE
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
2.1 Introduction
In this lesson we will study the Remainder theorem and Factor Theorem and their applications.
The applications include factorization of polynomials of degree greater than two and solution of
equations involving polynomials of degree 3 and higher.
r
We write f x g x q x r x or gf x
x
q x g
x
x .
Na MAIRINAI ZAKAYO
PHILIPO 13
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Example 2.1
Divide a)
f x 3x3 2x2 x 1 by i) g x x 1
ii) g x x2 2
b) f x 4x3 x 2 by g x 3x 2
Solution
a) i) 3x2 5x 6
x 1 3x3 2x2 x 1
3x3 3x2
5x2 x
5x2 5x
6x 1
6x 6
5
q x 3x2 5x 6 and r x 5
3x 2
2 3 2
ii) x 2 3x 2x x 1
3x3 6x
2x2 7x
2x2 4
7x 3
q x 3x 2 and r x 7x 3
14
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
4 x2 8 x 7 b) 3x 2
3 9 27
4x3 x 2
4 x3 8 x2
3
8 x2 x
3
8 x 2 - 16 x
3 9
7 x 2
9
7 x 14
9 27
40
27
Therefore q x 4 x2 8 x 7 and r x 40 .
3 9 27 27
Proof
f x x a q x r x .
Putting x a , we get f
a 0
q a r a
15
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Remainder r a f a
Example 2.2
b) x 2
Solution
f 1 1 4 2 3 2
3
4 2 2 2 3 1
Example 2.3
f x
Prove that when a polynomial is divided by ax b, where a 0 , the
b
remainder is f a . Hence find the remainder when 4x3 6x 5 is divided
1
by 2x .
Proof
f x r x
Suppose that when is divided by ax b, where a 0 the remainder is . Then
f x ax b q x r x .
b
Putting x , we get
a
f ba 0q ba r ba .
16
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
b b
Remainder r a f a .
f 1 4 1
f 21 3
2 2 6 12 5
5 .
2
=
R 0 f a 0.
Example 2.4
x 1 is not a factor of f x f 2 16 24 16 8 0
x 2 is a factor of f x
Dividing,
x3 x2 2x 4
x 2 x4 3x3 4x2 8 x4
2x3
- x3 4x2
x3 2x2
2x2 8
2x2 -4x
4x 8
4x 8
...
Na MAIRINAI ZAKAYO18
PHILIPO
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Next, we factorize f1 x x3 x2 2x 4 . Now
f1 1 1 1 2 4 0 x 1 is not a factor of f1 x
f1 2 8 4 4 4 0 x 2 is not a factor of f1 x
f1 1 1 1 2 4 x 1 is a factor of f1 x
x2 2x 4
3
x 1x x2 2x 4
x3 x2
-2x2 2x
2x2 2x
4x 4
4x 4
...
By using try and error method, it can be shown that x2 2x 4 no linear factors. Hence x4
3x3 4x2 8 x 2 x 1 x2 2x 4
Example 2.5
Solution
Let f x x3 7x 6 then, f 1 1 7 6 0 x-
1 is not a factor of f x f 2 8 14 6 0 x-
2 is not a factor of f x f 1 1 7 6 0
x +1 is a factor of f x
x2 x 6
3
x 1 x 7x 6
x3 x2
19
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
x2 7x
x2 x
6x 6
6x 6
... x2 x 6
x 3 x 2 .
Therefore
x 1 x 3 x 2 0
x 1, or x 3or x 2.
20
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
E-moderator • Focussing group discussion
interventions • Encouraging lurkers (quiet ones) to contribute
• Providing feedback/ teaching points
• Closing the discussion
Schedule and This activity should take one hour.
time
Next Permutations
2.3 Assessment
a) 2x+1 b) 3x-2
21
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
LESSON THREE
PERMUTATIONS AND COMBINATIONS
3.1 Introduction
In this lesson we will study Permutations and Combinations. In mathematics, the notion of
permutation relates to the act of permuting, or rearranging, members of a set into a particular
sequence or order. Permutations occur, in more or less prominent ways, in almost every area of
mathematics. They often arise when different orderings on certain finite sets are considered,
possibly only because one wants to ignore such orderings and needs to know how many
configurations are thus identified. On the other hand combinations are selections that disregard
order.
3.2.1 Permutations
3.2.1.1 The Fundamental Counting Principle
The Fundamental Counting Principle gives the guiding rule for finding the number of ways to
accomplish two tasks.
If there are m ways to do one thing, and n ways to do another, then there are m n ways of doing
both.
Example 3.1
a) Let’s say you want to flip a coin and roll a die. There are 2 ways that you can flip a coin
and 6 ways that you can roll a die. Therefore there are 2 6 12 ways that you can flip a
coin and roll a die.
b) If you want to draw 2 cards from a standard of 52 cards without replacing them, then there
are 52 ways to draw the first and 51 ways to draw the second, so there are a total of 52 51
2652 ways to draw the two cards.
Definition 3.1 (Permutations)
22
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
A permutation is an arrangement of a number of objects in a particular order.
Example 3.2
In how many ways can letters A, B and C be arranged in three consecutive positions?
Solution
ABC
ACB
BAC
Six permutations
BCA
CAB
Na
MAIRIN
CBA AI
Or equivalently, ZAKAY
1st 2nd 3rd
A B C
O
C B
PHILIP
B A C
O
C A
C A B
B A
That is
1. If we have ABC, we can choose either A or B or C for the first position. Therefore there are
3 distinct ways of filling the first position.
2. Once the first position is filled two letters remain and any of them can be used in the 2 nd
position. For each of the 3 ways of filling the 1 st position, we have two ways of filling the
second position.
6 ways.
Similarly, if there are four objects, then there are
23
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
4 3 2 1 24 ways of arranging them and so on
Each of the arrangements in the above example is called a permutation.
Definition 3.2
n n 1 n 2 3 2 1
which is denoted by n! and read as ‘n factorial.’
4! 4 3 2 1 24
3! 3 2 1 6
2! 2 1 2
1! = 1
Example 3.3
Evaluate
a)b)
!
Solution
a) 9! 9 8 7! 9 8 36 Philipo
2! 7! 2!7! 2
b) 6!2 6 5 4 3! 6 5 4 20
(3!) 3!3! 3 2 1
Example 3.4
40 39 38 37 40 39 38 37 36 35 3 2 1
36 35 3 2 1
!
24
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Now, consider a situation where 4 letters are to be filled in two positions. How many arrangements
or permutations are there for 2 objects chosen from 4 objects?
Therefore the total number of arrangements of 2 objects chosen from 4 objects will be 4 3
12 .
4! 4!
But 4 3 .
2! 4 2 !
In the same way,
But 5 4 5! 5! .
3! 5 2 !
5! 5!
But 5 4 3 .
2! 5 3 !
Definition 3.3
The number of arrangements or permutations of r objects chosen from n distinct objects denoted
n!
by nPr is given by nPr ,r n and n is an integer .
n r !
Example 3.5
In a lottery a total of a thousand tickets were sold. Determine the winners of the 1st, 2nd, and the 3rd
prizes if three tickets are drawn one after the other?
Solution
This is a permutation of 3 tickets chosen from 1000 tickets. Therefore we have,
25
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
1000 P3 1000! 1000! 1000 3 !
997!
=
=9.97 108 ways.
Example 3.6
Five letter words are formed from letters of the word TIEGROUP. How many of these have no
repeated words?
Solution
These are distinct arrangements of 5 letters chosen from 8 letters. Thus we get
8 P5 8! 8!
8 5 ! 3!
=
=6720.
Remark 3.1
In some cases the objects to be arranged may not be distinct as some may be repeated. E.g.
If we have n objects of which r1 of the first kind are alike, r2 of the second kind are alike, …., rk of
the kth kind are alike, then the number of distinct permutations is
n!
.
r1!r2 !rk !
Example 3.7
Solution
i) 7! 7 6 5 4 3 2 1 1260
2!2! 2 1 2 1
26
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
ii) 9, 979, 200
!
Example 3.8
How many even numbers, greater than 2000, can be formed with the digits 1, 2, 4, 8 if each digit
can be used only once in each number?
Solution
If the number is greater than 2000, the first digit can be chosen in 3 ways i.e. 2, 4 and 8. Then
whichever has been chosen to be the first digit, there are two ways in which the last digit may be
chosen, in order to make the number even. The second digit can be chosen in two ways and this
leaves one integer for the third place.
3 2 1 2
Example 3.9
How many arrangements can be made of the letters chosen from PEAT if the first letter is a vowel
and each arrangement contains three different letters?
Solution
1st 2nd 3rd
2 3 2
Total arrangements 2 3 2 12 .
Etivity 3.2.1: Permutations
Numbering and 3.2.1
pacing and
sequencing
Title Permutations
Purpose To help you solve counting problems using permutations.
Brief summary of Watch the video on Permutations by OCL Phase 2 and solve the given
overall task questions.
27
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Spark
Thus ABC, ACB, CBA are different permutations but they are the same combinations of letters.
Example 3.10
How many committees of three persons can be made of five persons namely; Anderson, Beatrice,
Charles, Duncan and Eunice?
Solution
Let A Andrew ABC BCD CDE
B Beatrice ABD BCE
C Charles ABE BDE
28
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
D Duncan ACD
E Eunice ACE
ADE
Therefore there are 10 different committees or combinations of 3 persons chosen from five.
However there are 5P3 60 distinct permutations of 3 letters chosen from the letters of the word
ABCDE. Thus one combination of three letters can be rearranged to give 3! 6 permutations.
Definition 3.4
In general, the number of combinations of r objects chosen from n distinct objects is given by
n
n n n! n Pr
Cr or r r! n r ! or Cr
r!
5 5 5!
C3 or 3 3! 5 3 !
= =10
Example 3.11
Five policemen are to be selected for duty from a force of 20. In how many ways can this be done?
Solution
20 C5 20!
5! 20 5 !
=
!
= 15, 504.
29
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Example 3.12
A mixed hockey team containing 5 men and 1 women is to be chosen from 7 men and 9 women.
In how many ways can this be done?
Solution
5 men can be chosen from 7 men in 7 C5 ways and 6 women can be chosen from 9 women in 9 C6
ways. Therefore by the Fundamental Counting Principle, the total number of ways of selecting the
team is
9 7! 9!
7 C5 C6
5! 7 5 ! 6! 9 6 !
=
=21 84
=1764
Example3.13
A girl wants to invite 8 friends but there is only room for 4 of them. In how many ways can she
chose whom to invite if two of them are sisters and must not be separated?
Solution
Consider two cases
6 6!
C4 15 ways.
4!2!
1 6!
C2 15 ways.
2!4!
30
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Therefore the total number of ways is 15
+15 = 30.
Numbering 3.2.2
and pacing
and
sequencing
Title Combinations
Purpose To help you to count using combinations.
Brief summary Watch the video on Combinations by OCL Phase 2 and answer the given
of overall task questions.
Spark
1. Simplify
!!
2. How many odd numbers, greater than 500, 000 can be made from the digits 2, 3, 4, 5, 6, 7
3. A committee of six is to be formed from 9 women and 3 men. In how many ways can the
members be chosen so as to include at most 2 men?
3.4 References
1. Backhouse, J. and Houldsworth, S. (1985). Pure Mathematics Book I, Longman Publishers
Ltd.
2. Bostock, L., Chandler, S. and Rourke, C. (1982). Further Pure Mathematics. Stanley
Thornes Publishers Ltd.
LECTURE FOUR
BINOMIAL THEOREM AND ITS APPLICATIONS
4.1 Introduction
In this lesson we will study the Binomial Theorem and its applications. The Binomial Theorem
describes the algebraic expansion of powers of a binomial without actually multiplying out.
i) State and apply the Binomial Theorem for a positive integer. ii)
32
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
4.2.1 Binomial Theorem for a positive integer
0
a b 1
1
a b a b
2
` a b a2 2ab b2
3
a b a3 3a2b 3ab2 b3
4
a b a4 4a3b 6a2b2 4ab3 b4
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
This triangular array is called the Pascal’s Triangle (up to degree 4). The entries of any row in the
Pascal’s triangle can be obtained from the row immediately above it by simply adding consecutive
entries of the latter row.
Example 4.1
3
Expand 2x 3y in descending powers of x.
Solution
This is a binomial of degree 3. Thus from the Pascal’s triangle the coefficients are
1, 3, 3, 1
33
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
3 3 2 2 3
2x 3y 2x 3 2x 3y 3 2x 3y 3y
=8x3 36x2 y 54xy2 27y3
Example 4.2
1 4
Obtain the expansion of 2x 2 , in descending powers of x.
Solution
This is a binomial of degree 4. Thus from the Pascal’s triangle the coefficients are
1, 4, 6, 4, 1
2x 1 4 2x 4 4 2x 3 12 6 2x 2 12 2 4 2x
12 3 12 4
1 1 1
=16x4 4 8x3 2 6 4x2 4 4 2x 8 16
1
3
Consider the binomial a b of degree 3. Expanding we get
a3 3a2b 3ab2 b3 .
Observe that the coefficients in this expansion can also be obtained as follows;
3 3 3 3
1 0 , 3 1 , 3 2 , 1 3 .
In general, we have
34
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Theorem 4.1 (The Binomial Theorem)
If n is a positive integer,
a b n n0 an 1n an 1b n2 an 2b 2 nn bn , where
n n!
r r! n r !.
Example 4.3
Solution
3 4
14 10 4
Example 4.4
Obtain the first four terms of the expansion of 1 12 x 10 in ascending powers of x. Hence
10
find the value of 1.005 correct to four decimal places.
Solution
1 5x x2 15x3 6.1
Since
10 10 1 10
1.005 1 .005 and comparing with 1 2x we get
12 x 0.005
x 2 0.005 0.01
1
Substituting this value of x in equation 6. we obtain
1.005 10
1 5 0.01 0.01 2 15 0.01 3
=1+0.05+0.001125+0.000015+
=1.0511 (4 dp)
Example 4.5
Solution
1 x 2x2 8
1 x 2x2 8
2 2 2 2 3
8 8 8
=1+ 1 x 2x 2 x 2x 3 x 2x
=1 8x 12x2 56x3
36
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Etivity 4.2.1: Binomial Theorem for a positive integer
Numbering and pacing and 4.2.1
sequencing
Title Binomial Theorem for a positive integer
a) 2x 3 6
, 6th term
b) x 2 20 , 20th term
2. Use Binomial Theorem to find the value
of
10 10
1.01 , 3 dp b) 2.001 , 6 sigf
37
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Next Binomial Theorem for any index
4.2.2 Binomial Theorem for any Index
Theorem 4.2
1 x n 1 nx n n 1 x2 n n 1 n 2 x3 ,
2! 3!
provided 1 x 1 ie x 1.
Example 4.6
3
1
Expand in ascending powers of x as far as the term in x .
1 x
Solution
1 1
1 x n -1
1 x
Therefore
1 2 1 2 3
1 x 1 1 1 x 2! x 2 3! x
3
=1 x x2 x3 , provided x 1.
Example 4.7
Obtain the first five terms of the expansion 1 2x in ascending powers of x. State the values of
x for which the expansion is valid.
Solution
1 2x 1 2x 12
,n 12
Therefore
38
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
1 12 1 1 3
2
1 2x 12 1 12 2x 2! 2x 2 2 3!2 2 2x 3
12 12 32 52
4! 2x 4
=1 x 12 x2 12 x3 58 x4
Solution
2
2 1x 2 2 x 2 2 1
2x
2 2 1 2x 2
3
x 2
2 2 3 4 3
= 14 1 2 2 2! 2x + 3! 2x +
= 14 1 x 34 x2 12 x3
= 14 14 x 316 x2 18 x3
Example 4.9
3
1 2x
Expandup to the term including x . 1 x
Solution
1 2x 1 2x 12 1 x 1
1 x
Now,
1 1 1 1 3
2 2 2 2
1 2x 12
1 12 2x 2 2! 2x 2
3 ! 2x 3
1 x 12 x2 12 x3
and
1 x 1
1 ( 1)( x) ( x) 2 ( x) 3
=1 x x2 x3
Therefore
1 2 x
1 x 1 x 1 x2 12 x 3 1 x x2 x3
= 1 x x2 x3 x x2 x3 12x2 12x3
12 x3
=1 2x+ 32 x2 2x3
40
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Example 4.10
12
Find the first four terms in the expansion of 1 8x in descending powers of x. Substitute
12 12 12 12 32
12
( 8x) 2 ( 8x) 3
1 8x 1 12( 8x) 2! 3!
=1 4x 8x2 32x3
100 2
10
= 23
Also
1
1 8 2
100 1 4(0.01) 8(0.01) 2 32(0.01) 3
2 23 0.959168
10
23 0.959168 10 4.79584
2
4.7958.
Etivity 4.2.2: Binomial Theorem for any index
41
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Numbering and pacing and 4.2.2
sequencing
Title Binomial Theorem for any index
Purpose To enable you to carry out binomial expansion for any
index.
Brief summary of overall task Watch the video on Binomial Theorem for any index by
Doubtnut and answer the given questions.
Spark
1 1
3
b) 1 x
a) 1 2 x 2 x c)
1 x
Interaction begins • Post your answers on discussion forum 4.2.2
Read what your colleagues have posted.
• In a sentence or two, comment on what two of
your colleagues have posted keeping netiquette
in mind
1. Expand 1 2x x2 6
as far as the terms in x3 .
12
2. Obtain the first four terms of the expansion of 1 8x in ascending powers of x.
42
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
3. Show that if x is small enough for its cube and higher powers to be neglected,
1 x x2
1 x .
1 x 2
4.4 References
2. Bostock, L., Chandler, S. and Rourke, C. (1982). Further Pure Mathematics. Stanley
Thornes Publishers Ltd.
43
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
LECTURE FIVE
SET THEORY
5.1 Introduction
In this lesson we introduce sets theory, Venn diagrams and applications to counting. The concept
of set is fundamental to mathematics and computer science. Everything mathematical starts with
sets. For example, relationships between two objects are represented as a set of ordered pairs of
objects, the natural numbers, which are the basis of other numbers, are also defined using sets,
graphs and digraphs consisting of lines and points are described as an ordered pair of sets and so
on.
A set is a well-defined list or collection of objects. The different objects that form a set are called
members or elements of the set. The members making up a set are enclosed in braces (curly
brackets) i.e. { }. We usually denote sets by capital letters. For example A 1,10, 5, 3 is a set
having four members.
A set is finite or infinite according to whether it has a finite or infinite number of members. For
example
Example 5.1
a) The set x x2 1 0 and x is a real number is empty for x2 1 0 has no real solution.
b) The set x: x is an even integer lying between 10 and 11, 10 not included is empty.
Membership of a Set
Thus if A 1, 5, 6, 7 , then 1 A .
d
The symbol means ‘is not a member of’ or ‘doesn’t belong to’. Thus if B a, b, e, , then
x B.
Equality of Sets
Two sets A and B are said to be equal, written A B , if they have exactly the same members.
Remark 5.1
The order in which members of a set are listed down is immaterial.
For example
45
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Cardinality of a set
Remark 5.3
The empty set is a subset of any other set since it has no members. The subsets a) to g) are proper
subsets of A.
Example 5.3
Example 5.4
Equality of Sets
A set A is said to be equal to B written A B if A B and B A . Therefore in order to prove that
A B we need to show that x A x B and x B x A.
46
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Universal Set
If we have some sets under consideration, a fixed set which contains all these subsets is called the
universal set and it is denoted by U.
Example 5.5
set to be either
Brief summary of overall task Watch the video on introduction to set theory Jeff
Suzuki and then
Discuss the basic concepts in set theory
Spark
47
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Interaction begins • Post your answers on the discussion forum
5.2.1 Read what your colleagues have posted.
• In a sentence or two, comment on what two of
your colleagues have posted keeping netiquette
in mind
Complement of a set
If U is the universal set and A is a subset of U, then all elements of U which do not belong to A
form the complement of A. The complement of A is denoted by Ac . Thus Ac x: x U and
x A .
Diagrammatically,
48
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
A
Ac
Example 5.6
Let U 1, 2, 3, 4, 5, 6 and A 1, 3, 5 .
Then Ac 2, 4, 6 .
Intersection
Let A and B be two sets. Then the set of elements which are common to both A and B is called the
intersection of A and B, denoted by A B .
Thus
A B x: x A and x B .
Diagrammatically,
49
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
A
B
Solution
A B 7, 9
If A and B have no elements in common i.e. A B , then A and B are said to be disjoint.
Diagrammatically,
A B
Example 5.8
Union
The union of two sets A and B is the set of all elements contained in A or B. The union of two sets
A and B is denoted by A B (read A union B). Therefore
50
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
A B x x A or x B .
Diagrammatically,
A B
A\ B A B x x A, x B .
Diagrammatically,
A B
Shaded area is A\ B .
51
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Example 5.9
a) A\ B 1, 2 and b) B \ A 6
A B
Shaded area is A\ B .
Example 5.9
a) A\ B 1, 2 and b) B \ A 6
E-tivity 5.2.2: Venn diagrams and set operations
Numbering and pacing and 5.2.2
sequencing
Title Venn diagrams and set operations
Brief summary of overall task Watch the video on Set and set operations by GVSU
Math and solve problems involving set operations.
52
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Spark Venn diagram involving three sets
53
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
1. A A A A A A Idempotent Law
2. A B C A B C A B C A B C Associative
Law
3. A B B A A B B A Commutative Law
4. a) A B C A B A C
b) A B C A B A C Distributive Law
5. a) A A
b) A U A
c) A U U Identity Laws
d) A
6. Ac c
A Involution Law
7. a) A Ac U
b) A Ac Complement Laws
c) Uc
c
d) U
8. a) A B c
Ac Bc De Morgan’s Laws
b) A B c Ac Bc
Remark 5.4
To prove equations involving set operations we use definition of equality of two sets. The
alternative method of proof involves use of a Venn diagram.
Example 5.10
We prove the first of the De Morgan’s Laws.
54
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Proof Method 1
Method 2
55
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Figure III
A B
Ac B c shaded
c
Since the shaded region in Figures I and III are identical then, A B Ac Bc.
Example 5.11
Use set algebra to simplify
a) A Ac B
b) A B A Bc
Solution
a) A Ac B A Ac A B
U A B
A B.
b) A B A Bc A B Bc
A U
A.
E-tivity 5.2.3: Algebra of sets
56
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Numbering and Pacing and 5.2.3
Sequencing
Title Algebra of sets
Brief summary of overall task Watch the video Laws of set theory by Mouna Naravani and
then simplify set expressions.
Spark
a) A Ac B
b) S T Sc T S Tc
Interaction begins • Post your answers on the discussion forum
5.2.3 Read what your colleagues have posted.
• In a sentence or two, comment on what two of
your colleagues have posted keeping netiquette
in mind
For example
57
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
a) A a,b,c is finite since n A 3 .
Lemma 5.2
n A n B .
Proof
n A
In counting elements of A B , first count those that are in A. There are of these. The only
other elements of A B are those that are in B but not in A. But since A and B are disjoint, no
n B
elements of B is in A, so there are elements that are in B and not in A. Therefore
n A B n A n B .
Theorem 5.3 [Inclusion-Exclusion Principle]
n A n B n A B .
Proof
n A n B
This follows from the fact that when we add and , we have counted the elements
of A B twice.
This Principle holds for any number of sets.
Theorem 5.4
n A B C n A n B n A n A B n A C n B C n A B C .
Example 5.12
Among 50 students in a class, 26 got an A in the first examination and 21 got an A in the second
examination. If 17 students did not get an A in either examination, how many students got A in
both the examinations?
58
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Solution
Let P be the set of students who scored A in the first exam, then P 26
Let Q be the set of students who scored A in the second exam, then P 21
Also
U 50 and P Q c
17 . Therefore
P Q 50 17 33 .
But
P Q P Q P Q
and so
33 26 21 P Q
P Q 26 21 33 14
Hence 14 Students scored an A in both exams.
Example 5.13
26 read Time
26 read Fortune
a) Find the number of people who read at least one of the three magazines.
59
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Solution
T n N F n T F n N T F
25 26 26 11 9 8 3 52
b) The required Venn diagram is obtained as follows;
11-3 = 8 read Newsweek and Time but not all the three magazines
9-3 = 6 read Newsweek and Fortune but not all the three magazines
8-3 = 5 read Time and Fortune but not all the three magazines
8
6
3 T
12 5 10
60
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
c) 8+10+12 = 30 read only one magazine.
Brief summary of overall task Watch videos on Applications of set theory Part 1 and
Applications of set theory Part 3 by Integrity Gurukul
and then solve counting problems.
Spark Applications
of set theory
Individual contribution • Watch videos on applications of set theory part 1
and 3
• Answer the question;
There are 30 students in a class. Among them, 8
students are learning both English and French. A
total of 18 students are learning English. If every
student is learning at least one language, how
many students are learning French in total?
Interaction begins • Post your answers on the discussion forum 5.2.4
Read what your colleagues have posted.
• In a sentence or two, comment on what two of
your colleagues have posted keeping netiquette in
mind
E-moderator interventions • Focussing group discussion
• Encouraging lurkers (quiet ones) to contribute
• Providing feedback/ teaching points
• Summarising key points
• Closing the discussion
Schedule and time This activity should take 1 hour
61
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Next Logic
5.3 Assessment
1. In a class of 80 students, 50 students know English, 55 know French and 46 know
German language. 37 students know English and French, 28 students know French
and Germany, 25 students know English and Germany and 7 students know none of the
languages. Find out
i) A Bc Ac B A B
A B . ii)
A B C A B A C
5.4 References
1. Goldstein, L., Schneider, D. and Siegel, M., Finite Mathematics and its applications, 7 th
Ed., Prentice Hall, 1998.
2. Grimaldi, R.P., Discrete and Combinatorial Mathematics. An applied introduction, 5 th Ed.,
Pearson Addison Wesley, 2004.
3. Edgar, G., Goodaire, M., Parmenter, M., Discrete Mathematics with graph theory, 2 nd Ed.,
2002.
4. Seymour Lipschutz and Marc Lipson. Schaum’s Outline Serires Discrete Mathematics, 3 rd
edition, McGraw-Hill Companies,Inc., 2007.
https://alas.matf.bg.ac.rs/~mi10164/Materijali/DS.pdf
LECTURE SIX
LOGIC
6.1 Introduction
In this lesson we will study Logic and logical operations. Logic is a language for reasoning. It is a
collection of rules we use when doing logical reasoning. Human reasoning has been observed over
centuries from at least the times of Greeks, and patterns appearing in reasoning have been
extracted, abstracted, and streamlined. In logic we are interested in true or false of statements, and
how the truth/falsehood of a statement can be determined from other statements. However, instead
of dealing with individual specific statements, we are going to use symbols to represent arbitrary
62
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
statements so that the results can be used in many similar but different cases. The formalization
also promotes the clarity of thought and eliminates mistakes.
Many proofs in Mathematics and many algorithms in Computer Science use logical expressions of
the form
It is necessary to know the cases in which these expressions are either TRUE or FALSE; what we
refer to as the truth values of such expression.
Definition 6.1
A proposition (or a statement) is a declarative sentence which is either true or false but not both.
Consider the following eight sentences;
e) 9<6 f) x = 2 is a solution of x2 4
g) Where are you going? h) Do your homework
All are propositions except g) and h). Moreover a), b) and f) are true whereas c), d) and e) are false.
6.2.1.1 Compound propositions
A logical connective is a symbol or word used to connect two or more propositions in a
grammatically valid way, such that the sense of the resulting proposition (called compound
proposition) depends only on the original proposition. A proposition which cannot be broken down
into simpler propositions is called a primitive proposition.
Example 6.1
a) Roses are red and violets are blue is a compound proposition with sub propositions ‘Roses
are red’ and ‘Violets are blue.’
b) John is intelligent or studies every night is a compound proposition with sub propositions
‘John is intelligent’ and ‘John studies every night.’
63
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
E-tivity 6.2.1: Introduction to Propositions
Individual
contribution • Watch the video on introduction to propositional logic
• Explain in your words giving examples the concepts of proposition
and compound proposition
64
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Conjunction p q
Any two propositions p and q can be combined by the word ‘and’ denoted to form a
compound proposition called conjunction of the original propositions. Symbolically this is
written p q,
and is read ‘p and q’. Since p q is a proposition, it has truth values that depend only on truth
values of p and q.
Definition 6.3
p q
p q p q
T T T
T F F
F T F
F F F
The four lines correspond to the four possible combinations of T and F for sub propositions p and
q.
Example 6.2
Disjunction p q
Any two propositions p and q can be combined by the word ‘or’ denoted to form a compound
proposition called disjunction of the original propositions. Symbolically this is written
p q
65
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
and is read as p or q. The truth values of p q depends only on the truth values of p and q as
follows;
Definition 6.4
If p and q are false, then p q is false; otherwise p q is true. Truth value of p q may be defined
equivalently by the table;
p q
p q p q
T T T
T F T
F T T
F F F
Example 6.3
Consider the following statements
Only the last statement is false. Each of the other statements is true since at least one of its sub
statements is true.
Negation ~p
Given any proposition p, another proposition called negation of p, can be formed by writing ‘it is
not the case that ….’ or ‘it is false that …’ before p or if possible by inserting in p the word not.
Symbolically this is written
~p
and is read ‘not p ’ or negation of p.
Definition 6.5
~p
66
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
p ~p
T F
F T
b) 3+2 = 5 or 6+1 = 7
Interaction begins • Post your answers on discussion forum 6.2.2
Read what your colleagues have posted.
• In a sentence or two, comment on what two of
your colleagues have posted keeping netiquette
in mind
E-moderator interventions • Focussing group discussion
• Encouraging lurkers (quiet ones) to contribute
• Providing feedback/ teaching points
• Closing the discussion
Schedule and time This activity should take one hour.
Next Propositions and truth tables
67
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
6.2.3 Propositions and Truth Tables
P ,
Let p1, p2 , pn denote an expression constructed from the logical variables p1, p2,..., pn ,
which take truth value TRUE (T) or FALSE (F) and various logical connectives , and ~ .
P
Such an expression p1, p2,, pn will be called a compound proposition. The main property
P
of the proposition p1, p2,, pn is that its truth value depends exclusively upon the truth
values of the variable. A simple and concise way to show this property is through a truth table.
6.2.3.1 Steps for constructing Truth Table
1. In the first row of the truth table the first n columns are for the variables p1, p2,..., pn .
Next, ensure that there are enough rows in the table to allow for all possible combinations
of T and F for these variables. (For two variables, 4 rows are necessary; for three variables,
8 rows are necessary and in general for n variables, 2n rows are necessary.
2. There is then a column for each elementary stage of construction of the proposition, the
truth value of each step being determined from previous stages by definition of connectives
, and ~ .
P
3. Finally we obtain the truth values of the proposition p1, p2,, pn which appears in
Example 6.4
Solution
~ p ~q
p q ~q p ~q ~ p ~q
T T F F T
T F T T F
F T F F T
F F T F T
68
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Remark 6.1
Example 6.5
p q r
p q R qr p q r
T T T T T
T T F F T
T F T F T
T F F F T
F T T T T
F T F F F
F F T F F
F F F F F
P
Some proposition p1, p2,, pn contain only T in the last column of their truth tables or, in
other words, they are true for any truth values of their variables. Such propositions are called
tautologies.
P
Analogously, a proposition p1, p2,, pn is called a contradiction if it contains only F in the
last column of its truth table, in other words, it is false for any truth values of its variables.
69
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Example 6.6
The proposition p or not p, that is p ~ p is a tautology, and the proposition p and not p, that is p
~ p is a contradiction.
a) p ~ p b) p ~ p
p ~p p ~p p ~p p ~p
T F T T F F
F T T F T F
Example 6.7
Solution
p q p
p q q p p q p
T T T T
T F F T
F T F F
F F F F
Two propositions P p1, p2,, pn and Q q1, q2,,qn are said to be logically equivalent or
equivalent, denoted
70
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Example 6.8
a) ~ p q b) ~ p ~ q
p q p q ~ p q p q ~p ~q ~p ~q
T T F F F
T T T F
T F F T T
T F F T F T T F T
F T F T F F T T T
F F F T
Observe that the last columns of both tables are the same; that is both propositions are false in the
first case and true in the other cases. Accordingly, we write
~ p q ~p ~q.
Example 6.9
Show that ~ p q ~ p ~ q.
Solution
a) ~ p q b) ~ p ~ q
p q p q ~ p q p q ~p ~q ~p ~q
T T F F F
T T T F
T F F T F
T F T F F T T F F
F T T F F F T T T
F F F T
Hence ~ p q ~ p ~ q.
E-tivity 6.2.3: Propositions and truth tables
71
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Numbering 6.2.3
and pacing and
sequencing
Title Propositions and truth tables
Another common statement is of the form ‘ p if and only if q’. Such statements are called
biconditional statements and are denoted by p q .
Definition 6.6
a) The conditional statement p q is false only if the first part p is true and the second part q
is false.
72
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Accordingly, when p is false, the conditional p q is true regardless of the truth value of
q.
b) The biconditional p q is true whenever p and q have the same truth values and false
otherwise.
a) p q b) p q
p q p q p q p q
T T T T T T
T F F T F F
F T T F T F
F F T F F T
c) ~ p q
p q ~p ~p q
T T F T
T F F F
F T T T
F F T T
Then the truth tables of ~ p q and p q are identical, that is, they are both false only in the second
case. Accordingly p q is logically equivalent to ~ p q ; that is p q ~ p q .
Example 6.10
Solution
a) Let p be ‘It is cold’ and q be ‘He wears a hat’. Then using p q ~ p q , we have
T T F F T T T T
T F F T F T T F
F T T F T F F T
F F T T T T T T
We observe that columns 5 and 8 are identical, thus only the contrapositive ~ q ~ p is logically
equivalent to the original conditional proposition p q .That is
p q ~q ~p.
Solution
i) Let p be ‘It snows’ and q be ‘They will drive the car’. Then Converse
q p
If they drive the car, then it will snow.
Inverse ~p ~q
If it does not snow, then they will not drive the car.
Contrapositive ~ q ~ p
74
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
If they will not drive the car, then it will not snow.
Contrapositive ~ q ~ p
If Mark does not study, then he will not pass the examination.
75
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
E-moderator interventions • Focussing group discussion
• Encouraging lurkers (quiet ones) to contribute
• Providing feedback/ teaching points
Show that
i) p q r p q
p r ii) ~ ~p p iii) p q
q p
6.4 References
1. Goldstein, L., Schneider, D. and Siegel, M., Finite Mathematics and its applications, 7 th
Ed., Prentice Hall, 1998.
2. Grimaldi, R.P., Discrete and Combinatorial Mathematics. An applied introduction, 5th
Ed., Pearson Addison Wesley, 2004.
3. Edgar, G., Goodaire, M., Parmenter, M., Discrete Mathematics with graph theory, 2 nd Ed.,
2002.
4. Seymour Lipschutz and Marc Lipson. Schaum’s Outline Serires Discrete Mathematics, 3rd
edition, McGraw-Hill Companies,Inc., 2007.
https://alas.matf.bg.ac.rs/~mi10164/Materijali/DS.pdf
76
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
LECTURER SEVEN METHODS OF PROOF
7.1 Introduction
In the previous lesson we considered how to determine the truth values of propositions
(statements). In this lesson we move a step further and consider methods of proving mathematical
statements. We will consider proof by Induction, Contradiction and Contraposition and direct
proof.
Direct proof is a way of showing the truth or falsehood of a given statement by a straightforward
combination of established facts, usually axioms, existing lemmas and theorems, without making
any further assumptions. Logical deduction is employed to reason from assumptions to conclusion.
A direct proof assumes that the hypothesis of a conjecture is true, and then uses a series of logical
deductions to prove that the conclusion of the conjecture is true.
Example 7.1
Proof
2m 2
4m2 2 2m2 .
Hence n2 is even.
Etivity 7.2.1: Direct Proof
77
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Brief summary of overall Watch the video on Direct proof by Centre of Maths and answer the
task given question.
Spark
In an indirect proof, instead of showing that the conclusion to be proved is true, you show that all
of the alternatives are false. To do this, you must assume the negation of the statement to be proved.
Then, deductive reasoning will lead to a contradiction: two statements that cannot both be true.
There are two types of indirect proofs: contradiction, contraposition and counterexample.
Example 7.2
p
2 , with p,q 1, q 0 and p and q are integers.
q
p
Therefore 2 qp22 2 2q2 .
Hence p2 is even so that p is also even. This implies that p 2k for some integer k , thus
2
2k 4k 2 2q2 and therefore q2 2k 2 .
Thus q2 and q are also even. Therefore both p and q are even, contradicting our earlier statement.
Hence 2 is irrational.
Given a set of hypotheses H1,H2,...,Hn from which we want to infer a conclusion C, for
Solution
Therefore,
n2 2k 1 2
79
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
4k2 4k 1
2 2k2 2k 1
Example 7.7
a) The statement “All prime numbers are odd numbers” is false since for example 2 is a prime
number and it’s not odd. In this case 2 is counter example.
Numbering 7.2.2
and pacing and
sequencing
Title Indirect proof
80
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Spark
Theorem 7.1
Let p n be a statement that is either true or false for each n N , then p n is true for
Example 7.4
81
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Proof
p k
ii) Assume that is true for some k N , that is p k 12k k 1 and show that
p k 1 is true.
Now, p k 1 1 2 3 k k 1
p k k 1
12k k 1 k 1
= 12 k 1 k 2
12 k 1 k 1 1
p 1
Hence k is true. Hence by inductive hypothesis the statement is true for all natural
numbers n.
Example 7.5
true for n 1.
Now, p k 1 7k 1
4k 1
7k
7 4k 4
82
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
7k 4 3 4k 4
7k 4 7k 3 4k 4
4 7k 4k 7k 3
4 3m 7k 3
3 4m 7k , which is a multiple of 3.
p 1
Hence k is true so that by inductive hypothesis the statement is true for all natural
numbers.
Example 7.6
Solution
Let p n n n 1 . Then
true for n 1.
ii) Assume that p k is true for some k N , that is p k k k 1 and show that
p k 1 is true.
Now, p k 1 2 4 6 2k 2 k 1
p k 2 k 1
k k 1 2 k 1
k2 k 2k 2
k 2 3k 2
83
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
k 1 k 2
k 1 k 1 1
p 1
Hence k is true so that by inductive hypothesis the statement is true for all natural
numbers.
E-tivity 7.2.3: Proof by induction
Spark
• Prove that
a) 2n 1 n2 , for all n N 1 3 5
b) 9n 7 is always divisible by 8
84
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
• Closing the discussion
2. Prove that
12 22 n2 16n n 1 2n 1 ,n N.
7.4 References
1. Goldstein, L., Schneider, D. and Siegel, M., Finite Mathematics and its applications, 7 th
Ed., Prentice Hall, 1998.
2. Grimaldi, R.P., Discrete and Combinatorial Mathematics. An applied introduction, 5 th Ed.,
Pearson Addison Wesley, 2004.
3. Edgar, G., Goodaire, M., Parmenter, M., Discrete Mathematics with graph theory, 2 nd Ed.,
2002.
4. Seymour Lipschutz and Marc Lipson. Schaum’s Outline Serires Discrete Mathematics, 3 rd
edition, McGraw-Hill Companies,Inc., 2007.
https://alas.matf.bg.ac.rs/~mi10164/Materijali/DS.pdf
LECTURE EIGHT
COMPLEX NUMBERS
8.1 Introduction
In this lesson we will study complex numbers. The set of all real numbers is incomplete in the
sense that standard operations applied to some real numbers do not yield a real number result (e.g.,
square root: 1 ). It is surprisingly easy to enlarge the set of real numbers producing a set of
numbers that is closed under standard operations, that is the subject of this lecture.
85
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
i) Carry out arithmetic operations on complex numbers ii)
We define i 1 , where i is an imaginary unit. This can be extended to find the square root of
other negative numbers.
Eg. 25 25 1
= 25 1
= 5i
Definition 8.1
The general form of a complex number z is x iy , where x and y are real numbers and i is the
imaginary unit. The numbers x and y are called the real and imaginary parts of z respectively written
x Re z and y Im z .
Let z x iy be a complex number, then the number x iy denoted by z is called the complex
conjugate of z.
Example 8.1
86
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
1. z1 z2 x1 iy1 x2 iy2
x1 x2 i y1 y2
2. z1 z2 x1 iy1 x2 iy2
x1 x2 i y1 y2
z1 z1 x1 iy1 x1 iy1
x1 2 x1y i1 x1y i1 y12i2
=x12 y12 (real number)
4. z1 x1 iy1 z2 x2 iy2
We can rationalize the denominator by multiplying by the conjugate of z2 in the numerator and
denominator;
z1 z1 z2 x1 iy1 x2 iy2
z2 z2 z2 x2 iy2 x2 iy2
87
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
x1xx222 yy12y2 2 i xx2 2y21
xy12y2 2 .
Example 8.2
Let z1 1 i, z2 2 3i . Find
a) z1 z2 b) z1 z2 c) z1z2 d) z1 z2
Solution
1. z1 z2 1 i 2 3i 3 1 3 i
2. z1 z2 1 i 2 3i
1 1 3 i
3. z1z2 1 i 2 3i
2 3i 2i 3
2 3 3 2 i
4. Rationalizing the denominator, we get
z1 z1 z2 z2
z2 z2
1 i 2 3i
2 3i 2 3i
88
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
2 3i 2i 3
4 2 3i 2 3i 3
2 3 2 3 i
2 3 i2 3.
7 7
Example 8.3
Solve for x and y if
a) 3 4i x iy 1 i
b) 3x 2iy 7 5i xi 5y
x iy
c) 5 i
2 i
Solution
a) 3 4i x ix iy y
x y i x y
Therefore
x y 3
x y 4
-2y -1 y 12
x 72
89
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
b) Rearranging the given equation
3x 5y i 2y x 7 5i
Therefore
3x 5y 7
x 2y 5 x 1
y 2
x iy
c) 5 i implies that
2 i x iy
(5 i)(2 i)
10 5i 2i 1
11 3i
x 11 and y 3.
Numbering 8.2.1
and pacing
and
sequencing
Title Introduction to complex numbers
90
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Individual • Watch the video on operations with complex numbers
contribution
• Answer the questions;
1. Simplify
a) 2 i 3 4i b) 5 4i 7 i c) 3 i 4 i
2. Express with rational denominators
1 i 3i 2 5 4i 1
2
a) b) c) d) 1 i 1 2i 5 4i 1 i
Interaction • Post your answers on discussion forum 8.2.1 Read what
begins your colleagues have posted.
• In a sentence or two, comment on what two of your
colleagues have posted keeping netiquette in mind
y
The complex number z x iy can be represented by the ordered pair x, . This suggests that
z can be represented in the xy-plane called the z-plane or the complex plane or the Argand diagram.
On an Argand diagram, real numbers are represented on the x-axis and imaginary numbers on the
y-axis.
Thus the complex number P in the figure below for example can be read as 2,5 or 2 5i.
91
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
The Argand Diagram
Im (z)
P 2, 5
Re (z)
Let P represent the complex number z where z x iy , then P has Cartesian coordinates (x, y) .
Consider the figure below
P x, y
r y
By Pythagoras Theorem, r2 x2
y2 r x2 y2 .
Also
y y
cos xr , sin r and tan x.
92
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Definition 8.3
z r x2 y2 .
1 y
arg z tan x .
y
There is an infinite set of angles whose tangent is , so there is also an infinite set of arguments
x
y
for x iy . But the position of x, is unique and corresponds to only one value of in
x
cos x rcos
r
and
x
sin x rsin
r
z x iy r cos i rsin
( ) is called the polar form of the complex number z. The polar coordinates of z are r, .
93
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Example 8.4
Modulus z 22
2 2
22
Also z is in the 4th quadrant;
2, 2
1 2 1
Principal value tan 2 tan 1 2 4 74 .
Therefore
arg z 74 2n , n 0,1, 2,
2 cos74 isin74 .
Example 8.5
Let z i , find z and arg z
94
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Solution
3
2
-i
z 0 i 1 and r z 02 1 2
Principal value is 3 2.
95
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
r1r2 cos 1 2 isin 1 2
Also z1z2 z1 z2 .
Since multiplication and division are inverse operations, it can be deduced that
z r
z 12 r 12 cos 1 2 isin 1 2
z1
arg arg z1 arg z2 z2
and
z1 z1
. z2
z2
Remark 8.1
so that
The expression ei cos isin is called the Euler’s formula. The Euler’s formula can be
generalized to ez ex iy
ex.eiy ex cos y isin y .
Example 8.6
1 3
If z1 2 i 2 and z2 1 i 3 , find
a) z1 z2
b) arg z1z2
96
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
z1
c) arg
z2
Solution
1 3
z1 z2 i 1 i 3
2 2
a)
1 2 2.
2 2
3
.
and arg z2
1
tan 3 3.
23 3 .
c)
zz12 2 3 3.
d) arg 3
97
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Numbering and 8.2.2
pacing and
sequencing
Title Geometric representation of complex numbers
Spark
3
1. Find the modulus and argument of w given that w i .
2
1 i
2. Express the quotientin its polar form.
3 i
Interaction begins • Post your answers on discussion forum 8.2.2 Read
what your colleagues have posted.
• In a sentence or two, comment on what two of your
colleagues have posted keeping netiquette in mind
98
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Next De Moivere’s Theorem and its applications
8.2.3 De Moivere’s Theorem and its Applications 8.2.3.1
z2 r2 cos2 isin2 .
In general, if z1 z2 zn z , then
cosn isin n .
n
cos isin cosn isin n .
n
cos isin cos n isin n .
Proof
n
We wish to show that cos isin cosn isin n . We proceed by induction. If n = 1,
k
cos isin cosk isin k .
99
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Then
k 1 k
cos isin cos isin cos isin
cosk isink cos isin
cos k isin k
cos k 1 isin k 1
Hence the theorem is true for the positive integer k + 1. Hence by the principal of mathematical
n
induction it holds for any positive integer. It can similarly be shown that cos isin
cos n isin n .
Example 8.7
a) 4 i43 b)
5 11 ii 33 10
Solution
4 i43 42 43 2
8 and arg 4 i43 3
By De Moivere’s Theorem,
5
4 i43 85(cos 3 isin 3)5
100
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
85(cos 53 isin 53 )
85 12 i 3 2
Example 8.8
By using De Moivere’s theorem show that
3
3tan tan tan3
2 .
1 3tan
Solution
tan3
3cos3 2 sin sin32
cos 3cos sin
cos cos
101
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
3tan tan2 3 .
1 3tan
Example 8.9
sin5 4 2
16cos 12cos 1
sin
Solution
By De Moivere’s theorem,
5
cos5 isin5 cos isin
But
5
cos isin cos5 5icos4 sin 10cos3 sin2 10icos2 sin3 5cos sin4 isin5
cos5 10cos3 sin2 5cos sin4 i(5cos4 sin 10cos2 sin3 sin5 )
Equating the real and imaginary parts cos5 cos5 10cos3 sin2 5cos sin4 and sin5
Now,
sin5 4 2 2 4
102
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
zn z0..........................................................1)
r0 r r01n
and
n 0 2 k, for k 0, 1, 2,
0 2 k
n , for k 0, 1, 2,
2 k 2 k
z r0 1n cos 0
n isin 0
n is the nth root of z0 for
n 0,1, 2,..., n 1.
Thus there are n distinct roots to be determined, the rest are merely repeated.
Example 8.10
Solution
z5 32 0 z5 32
In polar form
2,. Now, z 32 15
3215
cos 2 k isin 2 k 15
103
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
2 k 2 k
2 cos 5 isin 5 , where k 0,1, 2,
3, 4.
isin 5 , for k 0
3 3
w1 2 cos 5 isin 5 , for
7
2 w3 2 cos 5 isin7 5 ,
for k 3
9
w4 2 cos 95 isin 5 , for k 4
Example 8.11
Find all the cube roots of 2 i2.
Solution
Let z0 2 i 2 . Then
1
z0 2 2 2 and arg z0 tan 1 34 . Thus z0
2 cos 34 2 k isin 34 2 k , k 0, 1,
2,Now,
104
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
4
z z013 213 cos 3 2 k 3 2 k , k 0,1, 2
4
isin
3 3
13 2 k 2 k
isin 4 3 , k 0,1, 2 .
2 cos 4 3
isin 4 , for k 0
1 1 1 1
w1 213 cos 1 2 isin 1 2 , for k 1
1 9 1 9
w2 213 cos 1 2 isin 1 2 , for k 2.
Example 8.12
16
1 i
Evaluate 1 i .
Solution
Since
105
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
106
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
identities and find roots of complex numbers
Brief summary of Watch videos on Using De Moivere’s Theorem by Mattam66, De Moivere’s
overall task Theorem by Tayler Wallance and Problems on De Moivere’s Theorem by MA
Classes and answer the given questions.
Spark
cos isin
6
b) Find 3 i .
Interaction begins • Post your answers on discussion forum 8.2.3 Read what
your colleagues have posted.
• In a sentence or two, comment on what two of your
colleagues have posted keeping netiquette in mind
2 5i y x 3 i
a) x iy b) 2x 3iy 4ix 2y 5 10i x y 2
1 i
2. Use De Moivere’s theorem to show that
107
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
i)tan4 4tan 2 4tan 3 4 ii) tan5
5tan 102tan3 tan4 5
1 6tan tan 1 10tan 5tan
5 3
iii) cos5 16cos 20cos 5cos
8.4 References
1. a) 254 b) 34 c) 52
x x
4. a) Either the set of all x such that 23 or the set of all x such that 34 .
3 x 5
b) Either the set of all x such that .
7727
1. a) -7 b) a 4 b 13 4x3 13x 6
x 2 2x 1 2x 3
2. ,
108
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
Lesson Three Assessment Questions
1. 1820
2. a) 144 b) 7776 c) 756
2 . 1 8x 12
1 4x 8x2 32x3 and 3 1.73205
1. a) 12 b) 54 c) 7
3. w0 2 cos 4
isin 4 w1
2 cos3 4 isin3 4
w2 2 cos5 4
isin5 4 w3
2 cos7 4 isin7 4
109
COURTESY OF SANDRAH HAPPINESS.CONGRESSLADY SCHOOL OF
EDUCATION. 0793394796
RESOURCES
1. Backhouse, J. and Houldsworth, S. (1985). Pure Mathematics Book I, Longman Publishers
Ltd.
2. Bostock, L., Chandler, S. and Rourke, C. (1982). Further Pure Mathematics. Stanley
Thornes Publishers Ltd.
4. Goldstein, L., Schneider, D. and Siegel, M., Finite Mathematics and its applications, 7 th
Ed., Prentice Hall, 1998.
5. Grimaldi, R.P., Discrete and Combinatorial Mathematics. An applied introduction, 5 th Ed.,
Pearson Addison Wesley, 2004.
6. Edgar, G., Goodaire, M., Parmenter, M., Discrete Mathematics with graph theory, 2 nd Ed.,
2002.
7. Seymour Lipschutz and Marc Lipson. Schaum’s Outline Serires Discrete Mathematics, 3 rd
edition, McGraw-Hill Companies,Inc., 2007.
https://alas.matf.bg.ac.rs/~mi10164/Materijali/DS.pdf
110