Module Code: MAT1243

Module Title: Descriptive Statistics and Probability

Academic Year: 2023

Audience: MPE, MCE, MBE, MCsE, MGE & MEE
 Module Overview
➢Content is allocated in weeks from 19/10/2023 to 18/01/2024

➢The content is also divided into 3 main units with sections under
each unit:

Unit 1: Descriptive statistics; √ completely done

Unit 2: Bivariate Analysis; √ completely done

Unit 3: Introduction to Probability. √ currently ongoing

Unit 3: Introduction to Probability
 Unit 3 Objectives
By the end of this unit 3, student will be able
to:
➢ Understand various counting rules;
➢ Understand the basic probability concepts;
➢ Understand of the conditional probability;
➢ Understand the Bayes’ Theorem;
➢ Use counting rules, basic and conditional
probability as well as to use Bayes Theorem to
revise probabilities .
3.1 Counting Principle
3.1.0. Introduction
The Fundamental Counting Principle, sometimes referred to as
the fundamental counting rule, is a way to figure out the
number of possible outcomes for a given situation.
▪ While there are five basic counting principles: addition,
multiplication, subtraction, cardinality (principle of
inclusion and exclusion), and division.
Counting Principle, Cont’d
▪ Some times, a person can need to know the number of all
possible outcomes for a sequence of events.
▪ To determine this number, three rules (where one combines
two rules) can be used:

• Fundamental counting rule;

• Combinatory (i.e the permutation & the combination) rules.
•

3.1.1. Fundamental Counting rule

In a sequence of n events in which the first one has k1 possibilities and
the second event has k2 and the third has k3, and so forth, the total
number of possibilities of the sequence will be k1•k2 •k3 • kn
Note: In this case and means to multiply.
•

Example 1:
A coin is tossed, and a die is rolled. Find the number of outcomes for the sequence of events.
Solution 1:
Since the coin can land either heads up or tails up and since the die can land with any one of six
numbers showing face up, there are 2. 6 = 12 possibilities. A tree diagram can also be drawn for
the sequence of events.
Example 2:
The manager of a department store chain wishes to make four-digit identification cards for her
employees. How many different cards can be made if she uses the digits 1, 2, 3, 4, 5, and 6 and

a. repetitions are permitted? b. repetitions are not permitted?

Solution 2:
a. Since there are 4 spaces to fill on each card and there are 6 choices for each space, the total
number of cards that can be made is
𝑵 = 𝟔 . 𝟔. 𝟔 . 𝟔 = 𝟏𝟐𝟗𝟔
b. The first digit can be chosen in 6 ways. But the second digit can be chosen in only 5 ways, since
there are only five digits left, etc up to 4 spaces. Thus, the solution is
𝑵 = 𝟔 . 𝟓. 𝟒 . 𝟑 = 𝟑𝟔𝟎
Example 3:
Suppose a business owner has a choice of 5 locations in which to establish her business.
She decides to rank each location according to certain criteria, such as price of the store and
parking facilities. How many different ways can she rank the 5 locations?
Solution 3:

There are 𝟓! = 𝟓 . 𝟒 . 𝟑 . 𝟐 . 𝟏 = 𝟏𝟐𝟎 different possible rankings. The reason is that she has 5
choices for the first location, 4 choices for the second location, 3 choices for the third location,
etc. Factorial formula for non repetitions
For an counting n,
𝒏! = 𝒏 𝒏 − 𝟏 𝒏 − 𝟐 … … 𝟏
𝒏! = 𝟎
3.1.2. Combinatory Analysis
▪Combinatory analysis is the mathematical study of
permutations and combinations of finite sets of objects.
▪Combinatorics(used frequently in computer science to obtain
formulas and estimates in the analysis of algorithms), also
called combinatorial mathematics, is the field of mathematics
concerned with problems of selection, arrangement, and
operation within a finite or discrete system.
➢ We are concerned with combinatory for studying
permutations and combinations.
Permutations and Combinations
▪Permutations and combinations are used to find the various
ways in which objects from a set may be selected, generally
without replacement, to form subsets.
▪This selection of subsets is called a permutation when the
order of selection is a factor, (eg AB & BA are different combinations)
and a combination when order of arrangement is not a factor.
➢ In most of the permutation and combination questions, we
arrive at a point where we need to select or arrange a few
things and many people fall pray to the same mistake of
applying selection in place of arrangement and vice-versa.
 ❑ Permutation
A permutation is an arrangement of n objects in a specific order.
Important keywords to identify a combination question

Some of the important keywords in permutating are:

➢ Arrangements
➢ Ordered Ways
➢ Unique

Whenever you get a question having the above three keywords, it

will imply a permutation question.
Permutation, Cont’d;
Permutation rule or permutation formula
The arrangement of n objects in a specific order using r objects, is
called a permutation of 𝒓 things out of 𝒏, where order of
arrangement is important ( for instance AB and BA are two different
things if the arrangement used is permutation). It is written as 𝒏𝑷𝒓 .

the formula is (to be explained later):

𝒏! 𝒏! 𝒏!
𝒏𝑷𝒓 = ሺ𝒏−𝒓)!
or 𝒏𝑷 𝒓 = ሺ𝒏−𝒓)!
or 𝑷 𝒏, 𝒓 = ሺ𝒏−𝒓)!
Permutation, Cont’d;
In fact, take the permutation as the distinct
interpretations of a provided number of components
carried one by one, or some, or all at a time.

For instance, if we have two components A and B,

then there are two likely performances, AB and BA.
Permutation, Cont’d;
A numeral of permutations when ‘𝑟’ components are
positioned out of a total of ‘𝑛’ components is 𝒏 𝑷𝒓 .
For instance, let 𝑛 = 3 (A, B, and C for example) and
➢ For 𝑟 = 2 (All permutations of size 2 in the given
things). There are 3𝑃2 such permutations, which is equal
to 6.
These six permutations are AB, AC, BA, BC, CA, and CB.
➢For 𝑟 = 3 (All permutations of size 3 in the given things).
There are also six permutations of A, B, and C taken
three at a time as they can be shown in the image/tree on
next slide:
Permutation, Cont’d.
Six permutations of A, B, and C taken three at a time
Permutation, Cont’d.
As it cannot be always simple to use tree diagram,
especially when 𝑛 components is large, it is imperative to
use permutation formula.
Permutation formula is therefore used to find the number
of ways to pick 𝒓 things out of 𝒏 different things in a
specific order and replacement is not allowed and is
given as follows as was also provided above:
Example 1
Each signal that a certain ship can make is comprised of 3 different flags hanging
vertically in a particular order. How many unique signals can be made by using 4
different flags?
Solution 1:
To make a flag, order of colors is very important. In addition to this, there is a key
word unique therefore, permutation is used. The formula is:

𝒏!
𝒏𝑷𝒓 = ሺ
𝒏 − 𝒓)!

4! 4!
Number of unique si gnals = 4 P3 = = = 24
(4 − 3)! 1!
Example 2
From 3 letters, A, B, and C, how many 2-digit words can be
formed?
Solution 2:
In this case, AB is different from BA and so on. Hence the order
is important, and the permutation is used.
3! 3!
Number of 2 digits words = 3 P2 = = =6
(3 − 2)! 1!
Example 3
A license plate begins with three letters. If the possible letters
are A, B, C, D and E, how many different permutations of these
letters can be made if no letter is used more than once?
Solution 3:
The problem involves 5 things (A, B, C, D, E) taken 3 at a time.

5! 5!
P = = = 60
(5 − 3)! 2!
5 3
Example 4
A zip code contains 5 digits. How many different zip codes can be made with the digits 0–9 if no
digit is used more than once and the first digit is not 0?

Solution 4:
Using permutation formula:

We can’t include the first digit in the formula because 0 is not allowed.

For the first position, there are 9 possible choices (since 0 is not allowed). For the next 4
positions, we are selecting from 9 digits.
Permutation of repeated objects and with restrictions

Number of different permutations of n objects where there are

, , 𝒏𝒌 repeated item is given
𝒏𝟏 repeated items, 𝒏𝟐 repeated items ⋯
by:
𝒏!
𝒏𝟏 ! 𝒏𝟐 ! ⋯ 𝒏𝒌 !
Example 1
1.How many ways can the letters of the word MATHEMATICS be
arranged?
There are 11 letters in total, where M is repeated 2 times, A repeated 2
times and T repeated 2 times and the remaining have repeated one time
Solution 1:
𝟏𝟏!
𝐍𝐮𝐦𝐛𝐞𝐫 𝐨𝐟 𝐚𝐫𝐫𝐚𝐧𝐠𝐞𝐦𝐞𝐧𝐭𝐬 =
𝟐! 𝟐! 𝟐!
Exercise 2

How many ways can you order 2 blue marbles, 4 red marbles
and 5 green marbles? Marbles of the same color look
identical.

Solution 2:

𝟏𝟏!
𝐍𝐮𝐦𝐛𝐞𝐫 𝐨𝐟 𝐰𝐚𝐲𝐬 =
𝟐! 𝟒! 𝟓!
Permutations of 𝒓 objects from 𝒏 objects
For a set of objects, permutation is the arrangement of some or all
objects (arrangement of any 𝒓 ≤ 𝒏 of these objects) by taking into
consideration the order of the objects mentioned.
Example 1: The number of permutations for three letters A, B and C
taking two letters at time is 6. The arrangements obtain are:
AB, BA, AC, CA, BC, CB
Therefore, the number of permutations or ordered arrangements, of r
objects taken from n unlike objects is written as 𝑛𝑃𝑟 or 𝑃ሺ𝑛, 𝑟) and is
𝑛!
given by 𝑛𝑃𝑟 =
𝑛−𝑟 !
Note: using the formula, then find that 𝑛 = 𝑟. Then,
𝑛! 𝑛!
𝑛𝑃𝑟 = = = 𝑛!
𝑛 − 𝑛 ! 0!
Permutations of 𝒓 objects from 𝒏 objects, Cont’D;
Example 2:
In how many ways can the letters of MBE be arranged all letters at
time?
3! 3!
Solution 2: 𝑃ሺ3,3) = = = 3! = 6 ways
3−3 ! 0!
Example 3:
Find how many different number can be form by using four digits at a
time out seven digits: 1,2,3,4,5,6,7.
7!
Solution 3: 𝑃 7,4 = 𝑛𝑃𝑟 = = 840 𝑤𝑎𝑦𝑠
7−4 !
Permutations with repetitions
That is, the number of arrangements of n objects where p are of the
𝑛!
same kind and r of another kind is given by 𝑛𝑃𝑟 =
𝑝!𝑞!𝑟!
Example 1:
how many permutations can be made from the word MISSISSIPI taken
all at a time?
Solution 1:
The letter M occurs once, I occurs 4 times, S occurs 4 times, and P
occurs twice hence total is 11
11!
Number of permutations= = 34650
1!4!4!2!
Permutations with repetitions, Cont’D.
Example 2:
In how many ways the letters of the word PHOTOGRAPH
be arranged in row? How many of the arrangements
starts and end with H.
Solution 2:
10!
Number of arranging the letters is = 453600 ways
2!2!2!
The number of arrangements that start and end with H,
8!
we have 8 letters to arrange in between H given by =
2!2!
10080 ways
Notes on Factorial notation and Arrangements
The product of positive integers from 1 to n inclusive occurs very often in
mathematics and hence denoted using factorial formula 𝑛! (read n factorial)

Thus, by definition, the number of ways of arranging 𝑛 unlike objects in a line is 𝑛!

It is given by 𝒏! = 𝒏 × 𝒏 − 𝟏 × 𝒏 − 𝟐 × 𝒏 − 𝟑 … … × 𝟑 × 𝟐 × 𝟏
It is also convenient to denote that 0! = 1

Example 1: consider letters A, B, C, D

The first letter can be chosen in 4 ways, the second in 3 ways, the third in 2
ways and the 4 in only one way.
Therefore, number of ways arranging the four letters is 4! = 4 × 3 × 2 × 1 = 24

Example 2: 3! = 1.2.3 = 6 , 4! = 1.2.3.4 = 24, 6! = 1.2.3.4.5.6 = 720

Example 3: In how many ways can 5 men and 2 women be arranged in a row if:
a. the two women must be side by side
b. the two women must not be side by side
Solution 3:
a. The two women can be grouped into one unit and there are 2! ways of
arranging them.
ww m m m m m.
Now we have 6 objects (i.e 5 men and 1 unit containing 2 women) to be
arranged in a row. This can be arranged in 6! ways therefore, the number of
arrangements = 2! 6! = 1440
b. Total number of arrangements without restriction = 7!
The total number of arrangements with both women not side by side
= 7! − 2! 6! = 3600
Notes on Arranging object in a line n objects, of which p are alike
The number of ways of arranging object in a line n objects, of
𝑛!
which p are alike is given by
𝑝!
Instead of the letters A, B, C, D in previous example, you
may have the letters A, A, A, D.
4! 4×3×2×1
Then the 24 arrangements reduced to = =4
3! 3×2×1
Note:
the number of ways of arranging in a line n objects of which
type 𝑝 of one type are alike, 𝑞 of the second type are alike, 𝑟 of
𝑛!
the third type are alike, and so on… is given by
𝑝!𝑞!𝑟!…
Example 1: In how may ways the letters of the word STATISTICS be
arranged ?
Solution 1:
Consider the word STATISTICS, there are 10 letters and S occurs 3
times, T occurs 3 times and I occurs twice.
10!
Therefore, number of ways is = 50400
3!3!2!
There are 50400 ways of arranging the letters of the word STATISTICS
Example 2: how may ways the word LONDON can be arranged?
Solution 2:
6!
Number of ways to arrange LONDON is = 180
2!×2!
There are 180 ways of arranging the letters of the word LONDON
Notes on Arranging 𝒏 objects in a ring
The number of ways of arranging 𝑛 unlike objects in a ring when
clockwise and anticlockwise arrangements are different and given by
𝒏 − 𝟏 !, this means that one object is fixed and consider the
number of ways of arranging the remaining objects.

Example: consider four people A, B, C, D who are to be seated at

round table. find the number of possible arrangements of these
people around the table
Solution:
The number of arrangements of these four people around table is
given by 4 − 1 ! = 3! = 6 ways
 ❑ Combinations
➢ Combinations are used when the order or arrangement is not
important, as in the selecting process.
➢ Each of the sets that can be made by using all or part of given
collection of objects, without regard to order of objects in the
set is referred to combination.
➢ There are important keywords to identify a combination
question. Some of them are:
❖ Select
❖ Choose
❖ Pick
❖ Combination
 Combinations of 𝒓 objects from 𝒏 objects
➢When considering the number of combinations of 𝑟 objects selected
from 𝑛 objects, the order in which they are placed is not important.
𝒏
It is then denoted by 𝒏𝑪𝒓 or 𝒏𝑪 𝒓 or and is given by the formula
𝒓

𝒏! 𝒏! 𝒏 𝒏! 𝒏𝑷 𝒓
𝒏 𝑪𝒓 =
𝐫!ሺ𝒏−𝒓)!
or 𝒏𝑪 𝒓 =
𝐫!ሺ𝒏−𝒓)!
or
𝒓
=
𝒓! 𝒏−𝒓 !
=
𝐫!

Example 1:
The one combination ABC gives rises to 3! Permutations
ABC, ACB, BCA, BAC, CAB, CBA
Example 2: in how many ways can a hand of four cards be dealt from an
ordinary pack of 52 playing cards?
Solution 2: Since the order is not important,
52 52!
= = 270725
4 4! 52 − 4 !
Hence, the number of ways of dealing the hand of four cards is 270725
Example 3: A committee of 2 men and 3 women is to be chosen from 5
men and 4 women. How many different committees can be formed?
Solution 3:
5 5!
The e men can be selected in = = 10 𝑤𝑎𝑦𝑠 and the 3 women ca
4 4!
2 2!3!
be selected in = = 4 𝑤𝑎𝑦𝑠
3 3!1!
Each of the 10 ways of choosing men can be taken with each of the 4 ways
of choosing woman. Therefore, there are 10 × 4 = 40 possible committees
 Example 4
In a society of 10 members, we have to select a committee of 4
members. As the owner of the society, John is already a member of
the committee. In how many ways the committee can be formed.

Solution 4
By the application of 𝒏𝑪𝒓 formula, we can select 3 members
from 9 members in 9𝑪𝟑 ways, which is equal to:
𝟗!
𝟗𝑪𝟑 = = 𝟒𝟖 𝒘𝒂𝒚𝒔
ሺ𝟗 − 𝟑)! 𝟑!
Example 5
Six friends want to play enough games of chess to be sure
everyone plays everyone else. How many games will they have
to play?
Solution 5
There are 6 players to be taken 2 at a time. Using the formula:
6! 65
C = = = 15
6 2 4!2! 21
Example 6
A bucket contains the following marbles: 4 red, 3 blue, 4 green, and 3 yellow
making 14 total marbles. Each marble is labeled with a number so they can be
distinguished.
1. How many sets/groups of 4 marbles are possible?
2. How many sets/groups of 4 are there such that each one is a different color?
3. How many sets of 4 are there in which at least 2 are red?
4. How many sets of 4 are there in which none are red, but at least one is
green? Solution 6
14! 14131211
3 C2  10 C2 + 4 C3  10 C1 + 4 C4 = 270 + 40 + 1
1 C
14 4 =
10!4!
=
4!
=1001
4

C1  4 C1  4 C1  1C1 = 3  4  4  3 = 144 4 C1  6 C3 + 4 C2  6 C2 + 4 C3  6 C1 + 4 C4 = 80 + 90 + 24 + 1 = 195

2 3
4
Difference Between Permutation and Combination
Permutation Combination
In Permutation order of arrangement is In Combination order of
important. arrangement is not important.
For example, AB and BA are different For example, AB and BA are the
combinations. same combinations.
A permutation is used when different Combinations are used when the
kinds of things are to be sorted or arranged same kind of things are to be sorted
Permutation of two things out of three The combination of two things
given things A, B, C is AB, BA, BC, CB, from three given things
AC, CA. A, B, C IS AB, BC, CA.
𝒏!
Formula for permuation is: 𝒏𝑷 = The formula for Combination
𝒓 ሺ𝒏−𝒓)! 𝒏! 𝒏𝑷 𝒓
is: 𝒏𝑪 𝒓 = =
𝒓! 𝒏−𝒓 ! 𝐫!
 Binomial coefficients and Binomial Theorem
𝑛
The symbol reads 𝑛𝐶𝑟 , where 𝑟 and 𝑛 are positive with 𝑟 ≤ 𝑛, is
𝑟
defined as follows:
𝑛 𝑛 𝑛−1 𝑛−2 ….ሺ𝑛−𝑟+1)
= (i)
𝑟 1×2×3…. 𝑟−1 𝑟
These numbers are called binomial coefficients in view of binomial
theorem
𝑛 σ𝑛 𝑛 𝑛−𝑟 𝑟
𝑎 + 𝑏 = 𝑟=0 𝑎 𝑏 (ii)
𝑟
𝑛 𝑛−1 𝑛ሺ𝑛−1) 𝑛−2 2
= 𝑎 + 𝑛𝑎 𝑏+ 𝑎 𝑏 + ⋯ + 𝑛𝑎𝑏 𝑛−1 𝑏𝑛
1×2
𝑛
From (i) it is observed that has exactly 𝑟 factors in both numerator
𝑟
and denominator.
𝑛 𝑛 𝑛−1 𝑛−2 ….ሺ𝑛−𝑟+1) 𝑛 𝑛−1 … 𝑛−𝑟+1 𝑛−𝑟 ! 𝑛!
Also, = = =
𝑟 1×2×3…. 𝑟−1 𝑟 1×2×3… 𝑟−1 𝑟 𝑛−𝑟 ! 𝑟! 𝑛−𝑟 !
Using this formula and the fact that 𝑛 − 𝑛 − 𝑟 = 𝑟, we obtain the
following relation:
𝑛 𝑛 𝑛 𝑛
= or in other words, if 𝑎 + 𝑏 = 𝑛 then =
𝑛−𝑟 𝑟 𝑎 𝑏
10 10×9×8×7×6×5×4
Example: = = 120 this the same as
7 1×2×3×4×5×6×7
10 10 10×9×8
= = = 120
7 3 1×2×3

𝑛 𝑛−𝑟 𝑟
Note: from binomial theorem 𝑎 + 𝑏 = 𝑛 σ𝑛𝑟=0 𝑎 𝑏 , we note
𝑟 𝑛
that the following properties of expansion of 𝑎 + 𝑏 should be
observed:
 Properties of expansion of 𝒂 + 𝒃 𝒏

(i) There are 𝑛 + 1 terms

(ii) The sum of exponents of 𝑎 and 𝑏 in each term is 𝑛
(iii) The exponents of 𝑎 decrease term by term from 𝑛 to 0 while the
exponents of 𝑏 increase term by term from 0 to 𝑛
𝑛
(iv)The coefficient of any term is where 𝑘 is the
𝑘
exponent of either 𝑎 𝑜𝑟 𝑏
(v) The coefficients of terms equidistant from the ends are equal
We remark that the coefficients of successive powers of 𝑎 + 𝑏 can be
arranged in a triangular array of numbers. This is called Pascal’s triangle
 Pascal’s Triangle
In mathematics, Pascal's triangle is a triangular array of the binomial
coefficients arising in probability theory, combinatorics, and algebra.

To find a pattern, let’s write the coefficients in the expansion of (a + b)n

for the first few values of n in a triangular array, which is just called
Pascal’s triangle as said above.
The row corresponding to (a + b)0 is called the zeroth row. Find them next
Pascal’s triangle, cont’d

(a + b )0
1
(a + b ) 1
1 1
(a + b ) 2
1 2 1
(a + b )3
1 3 3 1
(a + b ) 4
1 4 6 4 1
(a + b )5
1 5 10 10 5 1
Example:

(a + b ) = a + 7a b + 21a b + 35a b
7 7 6 5 2 4 3

+35a b + 21a b + 7ab + b

3 4 2 5 6 7

(a + b ) = a + 5a b + 10a b + 10a b
5 5 4 3 2 2 3

+5ab + b4 5
 The Pascal’s Triangle, Cont’D
Although Pascal’s triangle is useful in finding the binomial expansion for
reasonably small values of n, it isn’t practical for finding (a + b)n for
large values of n.
• The reason is that the method we use for finding the successive
rows of Pascal’s triangle is recursive.
• Thus, to find the 100th row of this triangle, we must first find the
preceding 99 rows.

We need to examine the pattern in the coefficients more carefully to

develop a formula that allows us to calculate directly any coefficient in
the binomial expansion.
• As application in real life, Pascal's triangle is commonly used
in probability theory, combinatorics, and algebra.
• In general, we can use Pascal's triangle to find the coefficients of
binomial expansion, the probability of heads and tails in a coin
toss, the probability of certain combinations of things, and so on.
• Therefore, let n and r be nonnegative integers with r ≤ n.
•The binomial coefficient is denoted by
n
 
and is defined as: r 
n n!
 =
 r  r !(n − r )!
Binomial Coefficients
0
 
0
 1  1
   
0  1
 2  2  2
     
0  1  2
3 3 3 3
       
0  1  2 3
4  4  4  4  4
         
0  1  2 3  4
5 5 5 5 5 5
           
0  1  2 3  4 5
. . . . . . .
n n n  n  n
      . . .    
0  1 2  n − 1 n
To demonstrate that this pattern holds, we
need to show that any entry in this version of
Pascal’s triangle is the sum of the two entries
diagonally above it.
•That is, we must show that each entry
satisfies the key property of Pascal’s
triangle.
•We now state this property in terms of the
binomial coefficients.
Key Property of the Binomial Coefficients
For any nonnegative integers r and k with r ≤ k,

 k   k   k + 1
 + =
    
 r − 1   
r r 
• The two terms on the left side are adjacent entries in the kth row of Pascal’s
triangle.
• The term on the right side is the entry diagonally below them, in the (k + 1)st
row.
Thus, this equation is a restatement of the key property of Pascal’s triangle in
terms of the binomial coefficients.
 The Binomial Theorem

 n  n  n  n −1  n  n −2 2
(a + b ) =   a +   a b +   a b
n

0  1  2
 n  n −1  n  n
+ +  ab +   b
 n − 1 n
Example: Use the Binomial Theorem to expand (x + y)4
Solution:
 4 4  4 3  4 2 2
By the Binomial Theorem, ( x + y ) =   x +   x y +   x y
4

0 1  2
 4 3  4 4
+   xy +   y
3  4

 4  4  4  4  4

Verify that: 0  = 1   = 4   = 6   = 4   = 1
  1  2 3  4

It follows that:
( x + y ) = x + 4x y + 6x y + 4xy + y
4 4 3 2 2 3 4
 General Term of the Binomial Expansion
•The Binomial Theorem can be used to find a particular term of a
binomial expansion without having to find the entire expansion.

•The term that contains ar in the expansion of (a + b)n is:

 n  r n −r
  a b
 n − r 
Example 1: Find the term that contains x5 in the expansion of (2x + y)20.
Solution 1:
The term that contains x5 is given by the formula for the general term
with: a = 2x, b = y, n = 20, r = 5. therefore, the term is given by:

 20  5 15 20!
 a b =
5 15
(2 x ) y
 15  15!(20 − 15)!

20!
= 5 15
32 x y
15!5!

= 496,128 x y 5 15
Example 2: Find the coefficient of x8 in the expansion of 10
 2 1
x + x 
 
Solution 2: Both x2 and 1/x are powers of x. So, the power of x in
each term of the expansion is determined by both terms of the
binomial.
By the formula, we have: a = x2, b = 1/x, n = 10
So, the general term is:
10 − r
 10  2 r  1   10  2 r −1 10 −r
 (x )   =  x (x )
 10 − r  x  10 − r 
 10  3 r −10
= x
 10 − r 
•Thus, the term that contains x8 is the term in which 3r – 10 = 8,
then r = 6
So, the required coefficient is:

 10   10 
  =   = 210
 10 − 6   4 
Further exercise;
Further exercise, Cont’d;
Further exercise, Cont’d;
Further exercise, Cont’d;
Further exercise, Cont’d;
 4th MAT1243 GROUP ASSIGNMENT (NON-SUBMITTABLE ONE)

Check all exercises from MAT1243, section 3.1

Activity:
In your groups, work on all those exercises, even if
some are corrected, you must confirm their solutions.
Those exercises will be matter of the MAT1243 quiz
which will be done on 7th December 2023.
63