CHAPTER I

1.1.COMBINATORIAL ANALYSIS
It is the branch of mathematics that studies the various arrangements or selections that
we can form with the elements of a given set, which allows us
it allows us to solve many practical problems. For example, we can find out
How many different phone numbers, license plates, or lottery numbers can be formed?

using a given set of letters and digits.

We can also consider combinatorial analysis as the set of
procedures and techniques that allow us to determine the number of
subsets that can be formed from a given set, according to
certain instructions.
These must clearly indicate how two subsets differ from each other.
according to:
- Nature of the elements
- Order of the elements
1.2. FUNDAMENTAL PRINCIPLE
At the beginning of combinatorial analysis, it is also called Principle
Multiplicative.
If an event, fact, or occurrence takes place in 'n' different ways and another event,

independent of the previous one, it is done in 'm' different ways then, the two
events are held jointly in "n*m" different ways.
Example:
If there is a bus line that connects two cities A and B and has
of 10 machines in use. How many ways can a person go from A to B or
to return on a different bus?
Solution:
Going from A to B can be done in 10 different ways, and coming back from B to A can be done

do it in 9 different ways then, complete the journey, in the

given conditions, it is done in 10 x 9 = 90 ways.
1.3. FUNDAMENTAL PRINCIPLES OF COUNTING
1.3.1. PRINCIPLE OF ADDITION

Page | 5
 If an event E can occur in forms and a second event F can
occurring in forms and both events cannot occur in form
Simultaneously, then E or F can occur in m+n ways.
Example 01:
There are 3 male teachers and 2 female teachers who teach calculus.
A student can choose a teacher in 3 + 2 = 5 ways.
Example 02:
b) In a library, there are 3 different mystery novels, 5
novelas de romance y 4 novelas de aventura diferentes. Existen 3 + 5 +4
12 ways to choose a novel.
1.3.2. PRINCIPLE OF MULTIPLICATION
If an event can take place then1different ways and if continuing
the procedure, a second event can take place2ways
different and if after they are carried out, a third element can
take place in3different ways, then the number of ways in which
the events can be held1×n2×n3different ways.
Example 01:
The restaurant menu offers 3 hot dishes and 4 desserts. What about
how many ways can you choose a lunch of 1 hot dish and 1
dessert? A list of all the possibilities can be made, but it is
much more convenient to apply the principle of multiplication: There are 3

ways to choose the hot dish and for each of them there are 4
Ways to choose the dessert. Therefore, there are 3 * 4 = 12 possible meals.
1.4. MAIN TYPES OF GROUPINGS
1.4.1. PERMUTATIONS
They are called permutations of elements, the different groups that
can be constructed, taking them all at once. The permutations
implies order. Each ordered set of elements will be called
a permutation of different elements.
The formula is:

Pn=n!

Where:

Page | 6
 Pncorresponds to the number of possible permutations
Example 01
Determine the number of possible permutations of the letters A, B, C, D.
P4= 4! = 4 * 3 * 2 * 1 = 24
CASE 01: SIMPLE ORDINARILY PERMUTATION
It is called a simple permutation of n elements taken k at a time (k < n) to the
different groups formed by elements in such a way that:
o The elements that make up the group are distinct (they do not repeat).

o Two groups are distinct if they differ in any element or in the order.
in what they are placed (the order influences).
o Not all elements are used.
When choosing a first element, we can do it in various ways. We remove the
chosen element and we choose another one from the remaining n-1. This will be able to

becoming den-1 forms. We also remove this element and are left with
n-2, from which we choose the third. We will be able to do this den-2
ways. According to the product rule, the ways to choose k elements from
between a total of densegun in a certain order, will be equal to the product of:
n * (n−1) * (n−2) ⋅ ... ⋅ (n−k+1)
Notation.Pn,k, nPk yP(n, kthey denote the number of permutations of elements
different taken dekenk.
To arrive at a simplified version, it is operated as follows:

( n− ( k−1 ) )∗( n−k ) ( n− ( k +1) ) …( 3 ) ( 2 ) ( 1 ) n!

n ( n−1n−2n−3…
)( )( ) = =P(n , k )
( n−k ) ( n− k( +1 ) ) ...3( 2) ( )1( ) ( −k ) !

n!
P(n,k)=
( n−k ) !
Example 01:

P(10,4) are the permutations of 10 elements grouped in subgroups

of the 4 elements:
10∗9∗8∗7∗6∗5∗4∗3∗2∗¿
=5,040
6∗5∗4∗3∗2∗1
10!
P ( 10.4 )= =¿
( 10−4 ) !

Page | 7
Example 02:

How many different flags, with three horizontal stripes of equal width and
different colors, can they be made from seven different colors?
7!
P (7.3 )= =210
4!
Example 03:

How many three-digit numbers can be formed with the nine distinct digits?
Significant Figures of the Decimal System?
When it comes to numbers, the order matters and it also tells us 'distinct figures.'
then they cannot be repeated:
P9.3=9∗8∗7=¿ 504
Therefore, 504 numbers can be formed.
Example 04:

A mother has 3 sons. How many different ways are there to name them one by one?
Can you call them to dinner?
Solution: P3= 3! = 6
Example 05:

With the letters of the word DISCO, how many different words can be formed?
to form?
Evidently, when it comes to words, order matters. And also, it is
say we have to form five-letter words with five elements D, Í, S,
C, What is not repeated.
Solution P5= 5! = 5 * 4 * 3 * 2 * 1 = 120
CASE 02: PERMUTATION WITH REPEATION
This case is analogous to Case 01, with no modification other than not removing in each
I pass the chosen elements. Reasoning similarly leads to the conclusion that the number of

possible elections are:

n * n * n * … * n = nk
They are called permutations with repetition of n elements taken k at a time.
the different groups formed by k elements in such a way that:
The elements that make up the groups can be repeated.

Page | 8
Two groups are distinct if they differ in some element or in the order.
in that they are arranged (the order matters)
PR notationndenotes the number of permutations with repetition den
distinct elements of kenK.

PRn ,k=nk

Example 01:

How many three-digit numbers can be formed with the nine digits?
significant aspects of the decimal system?
When it comes to numbers, the order matters and it also says nothing about 'digits.
Different ones can then repeat.
PR9.3= 93= 729
Example 02:

How many distinct 10-letter words (with or without meaning) can be written?
using only the letters a,b?

When it comes to words, the order matters, and also because they are 10-letter words.
letters and we only have two to form them, they must be repeated.

PR10.2=210=1024

CASE 3: WE CAN REPEAT AND THERE ARE REPEATED ELEMENTS

They are permutations with repetition of elements, not all distinct. All the
groups of elements, formed by those, are arranged
linearly and without any missing.
The number of permutations with repetition that can be made with n
elements, where there are α1, α2, α3,... αm identical elements among them (of a
same class) and the different remains from each other and also different from the previous ones

Pn n!
α 1,α 2,α 3… ,α m=
α 1!∗α 2∗…∗α m!

Example 01
Calculate the permutations of 10 elements, where one of them is repeated.
twice and another one is repeated three times:

Page | 9
 10 10!
P=2,3 =302,400
2!x3!
Example 02
How many 6-digit numbers can be formed with the digits 1,1,1,2,2 and 3?
720
=60
3! x 2!
1.4.2. COMBINATIONS
CASE 01: THE ORDER DOES NOT MATTER BUT THEY CANNOT BE REPEATED

ELEMENTS.
We take the ∗ ( n−1 )∗(n−2 ) … (−k +1) possibilities and we divide them into

classes, so that in each class are those choices that are the same
except for the order.

For k elements, the way to arrange them will be k! and, thus, in each type there are
exactly k! cases.
Therefore, the number of types, that is, the number of possibilities to choose k
elements regardless of order and without repeating is
n∗( n−1 ) …(n−k +1) n!
=
k! k ! ( −k ) !
This number is usually known as the number of combinations of n
elements taken from k in k and denoted by:

n!
Ck,=
(nk)= k !( −k )!

It is called combinations of n elements taken k at a time ( k ≤ n) to all the

possible classes that can be made with n elements such that:

- Each group is made up of n distinct elements from each other.

- Two different groups differ in at least one element, without
take into account the order.

PROPERTIES OF COMBINATORIAL NUMBERS

- (( m0 )= (mm)=1 )

Page | 10
 - (mn)= ( m−m )

- (−1m )+ (mn )= (m+1

n )

Example 01
A student decides to take three of the five final exams. How many ways can this be done?

How many different ways can you choose those three tests?
5!
C53 = =10
3! x 2!
Example 02
How many combinations of 6 hits exist in the primitive lottery?

49!
( )
C 49.6= 49 =
6 6 ! ( 49−6 ) !
=13983816

Example 03
How many groups of 5 students can be formed from the thirty students?
a class? (A group is different from another if it differs from another by at least
in a student)
The order doesn't matter (they are groups of students). There can't be two students.

equal in a group obviously, then without repetition

30! 30∗29∗28∗27∗26∗25!
( )
C30.5 = 30 =
5 5 ! ( 30−5 ) !
=
5 ! ∗25!
=142506

CASE 02: THE ORDER DOES NOT MATTER AND ELEMENTS CAN BE REPEATED.
(COMBINATIONS WITH REPEATED ELEMENTS)

A combination with repetition of sizes is an unordered selection of

chosen objects among different types of objects, having a quantity
unlimited of each type. A combination with repetition can be described
saying that we choose x1type 1 objects, x2objects of type 2,..., xn objects of

Page | 11
type n for some n-plane (x 1, x2..., xnEach of the integers x1, x2..., xn is no
negative x 1+x 2 +…n=k
Thus, the combinations with repetition of tamanokse correspond to
the non-negative integer solutions of the equation:
x 1+x 2 +…xn=k
The number of combinations of tamanok with unlimited repetition chosen
between n different types of objects is:

R
Ck,=
(n−1+k
k )

Each combination with repetition is represented by a word in the alphabet.

{0,1} in the following way: The 0's are the marks that separate the objects of
each type and the 1's indicate the objects that are of each of the types among
two consecutive marks. If there are n types of objects, n-1 marks are needed.
to separate the types and, therefore, the words of 0's and 1's have length n-
1+k. This is how each combination with repetition of size k is converted into a
combination of k objects (the positions of the 1's) chosen from a set
of n-1+k elements (the positions).
It is called combinations with repetition of n elements taken k at a time.
different groups formed by k elements in such a way that:
The elements that make up each group can be repeated.
Two distinct groups differ in at least one element, without having
keep the order in mind.
Example 01
C1R0.4 These are the combinations of 10 elements with repetition, grouping them

in subgroups of 4, in which 2, 3 or all 4 elements could be repeated:

13! 13∗12∗11∗10∗9∗8∗7∗6∗5∗4∗3∗2∗1
C1R0.4 = = =715
4 ! x 9 ! ( 4∗3∗2∗1) ( 9∗8∗7∗6∗5∗4∗3∗2∗1
)
Example 02
In a candy store, there are five different types of cakes. How many ways are there to
Can you choose four cakes? The order doesn't matter (they are cakes). You can.
to have two or more cakes of the same type in a group, then with repetition.

Page | 12
 8! 8∗7∗6∗5∗4∗3∗2∗1
C5R,4 = = =70
4 ! (5−1) ! 4 ! ∗4 !
1.4.3. VARIATION

It is called ordinary variations of m elements taken n at a time (m ≥ n) to

the different groups formed by n elements in such a way that:

- Not all elements fit.

- Yes, the order matters.

- The elements do not repeat.

n
V m=m (m−1m−2m−
)( )3...
( (m−n+1)
)

We can also calculate the variations using factorials:

m!
V nm= (
m−n ) !

The variations are denoted by: Vnm o V m , n

CASE 01: VARIATIONS WITH REPETITION

It is called variations with repetition of elements taken from n.
different groups formed by n elements in such a way that:
Not all elements enter sim > n. All elements can enter if
m≤n
- The order does matter.
- Yes, the elements are repeated.

V mn =mn
Example 01
Calculate the possible numbers of ways to arrange the numbers 1,
2 and 3.
There are 6 grouping possibilities: (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2)
(3, 2, 1)
Example 02

Page | 13
 V 410 They are the variations of 10 elements with repetition, grouping them in
subgroups of 4 elements:
V 410 =104 =10000

Page | 14