Introduction

We can consider combinatorial analysis as the set of procedures.

and techniques that allow us to determine the number of subsets that can
to form oneself from a given set, according to certain instructions.

These must clearly indicate how two subsets differ from each other, from
agreement to:

the nature of the elements

the order of the elements.

We will perform the combinatorial analysis without repetition, meaning each element must
appear only once in each subset.
 PRINCIPLE OF COMBINATORIAL ANALYSIS:

If an event, fact, or occurrence can take place in 'n' different ways and another event,
independent of the previous one, it is done in 'r' different ways then, the two
events are carried out, jointly, in "nr" different ways

Observation.

The Principles of Combinatorial Analysis is also called the Multiplicative Principle.

Example:

If there is a bus line connecting two cities A and B that is available

Out of 10 machines in use, how many ways can a person go from A to B or
take a different bus back?

Solution:

Going from A to B can be done in 10 different ways, and returning from B to A

it can be done in 9 other different ways then, complete the journey, in the

Conditions set, it is done in 10990 ways.

Counting Rules.

When assigning probabilities, it is necessary to know how to identify and count the outcomes.
experimental, if the number of possible outcomes of an experiment is
small, it is relatively easy to list and count all possible outcomes. By
For example, when rolling a die, there are only 6 possible outcomes s = {1,2,3,4,5,6},
As has been seen previously, even throwing two dice, these can still be obtained.
S = {(1,1), (1,2), (1,3), (1,4), (1,5), (1,6), (2,1), (2,2), (2,3), (2,4), (2,5)
(2,6), (3,1), (3,2), (3,3), (3,4), (3,5), (3,6), (4,1), (4,2), (4,3), (4,4), (4,5), (4,6), (5,1),
(5,2), (5,3), (5,4), (5,5), (5,6), (6,1), (6,2), (6,3), (6,4), (6,5), (6,6) }

However, there are a large number of possible outcomes such as the number of
boys and girls from families with five children, it would be tedious to list and count them all.
possibilities. Which would be, 5 boys, 4 boys and one girl, 3 boys and 2 girls, etc. For
to facilitate counting let's look at three counting techniques, the multiplication method, the technique
of permutation and that of combination.
Multiplicative Principle.

If there are m ways to do one thing and there are n ways to do another thing, then
there are m x n ways to do both things, in other words, the total number of
Ways to do both things would be m x n, which can be extended to more than two.
events. For three events (m, n, o) the total number of events would be
it would be, of m x n x o.

In the example of the dice, a die can fall in 6 different ways, a

the second die can also land in 6 different ways, therefore both
dice can fall in 6 x 6 (36) different ways, if there were 3 dice then,
The ways they could fall would be 6 x 6 x 6 different ways (216).

Example 2:

A car salesman wants to present to his clients all the different

opciones con que cuenta: auto convertible, auto de 2 puertas y auto de 4 puertas,
any of them with sports or standard rims. How many different arrangements
What can the seller offer in terms of cars and rims?

To solve the problem we can use the technique of multiplication,

(where m is the number of models and n is the number of rim types). Total number
of arrangements = 3 x 2

It was not difficult to list and count all the possible arrangements of car models and
rings in this example. Suppose, however, that the seller has to offer
eight car models and six types of rims. It would be tedious to make a drawing with
all possibilities. Applying the multiplication technique easily
we performed the calculation:

Total number of arrangements = m x n = 8 x 6 = 48

Additive Principle

If one wishes to carry out an activity, which has alternative ways to be

carried out, where the first of those alternatives can be carried out from M
ways or forms, the second alternative can be carried out in N ways or
ways,....., and the last of the alternatives can be performed in W ways or
forms, then this activity can be carried out in M + N +.... + W ways
or shapes.

Example 1.

A person wants to buy a washing machine, for which they have thought that
you can choose from the brands Whirlpool, Easy, and General Electric, when
when going to do the shopping, it is found that the W washing machine comes in two types
(8 to 11 kg), in four different colors and can be automatic or semi
automatic, while washing machine E is available in three load types (8, 11 or
15 kg), in two different colors and can be automatic or semi-automatic and the
GE washing machine, available in a single type of load, 11 kg, two colors
different and there is only semi-automatic. How many ways does this person have to
buy a washing machine?

M = Number of ways to select a Whirlpool washer = 2 x 4 x 2 = 16

ways

N = Number of ways to select an Easy washing machine = 3 x 2 x 2 = 12

ways

W = Number of ways to select a GE washer = 1 x 2 x 1 = 2 ways.

Therefore, the washing machine can be chosen in 16 + 12 + 2 different ways.

Note: it is interesting to note that the purchase of a washing machine responds to a phrase "or
"I buy W or I buy E or I buy GE," but no more than one is purchased.
Example 2.

Carlos Pérez wants to go to Cancun or Playa del Carmen soon.

summer vacation, to go to Cancun, there are three means of transportation to go
to Mérida and 2 to go from Mérida to Cancún, and to go to Playa del Carmen from
Mérida has four different means of transportation:

a) How many different ways does Carlos have to go to Cancún or to Playa del
Carmen?

b) How many different ways does Carlos have to go to Cancun or Playa del
Carmen on a round trip, if she doesn't return by the same means of transport as she
What went away?

a) M = Ways to go to Cancun = 3 x 2 = 6

N = Ways to go to Playa del Carmen = 3 x 4 = 12

therefore

M + N = 6 + 12 = 18 ways

b) M = Ways to go to and return from Cancun = 3 x 2 x 1 x 2 = 12

N = Ways to go to and return from Playa del Carmen = 3 x 4 x 3 x 2 = 72

Therefore

M + N = 12 + 72 = 84
 FACTORIAL OF A NUMBER

It is the product of all natural numbers less than it and is represented by the
n!

n! = n · (n-1)! · (n-2) · ... · 3 · 2 · 1

Example 1: find 6!

6! = 6 x 5 x 4 x 3 x 2 x 1 = 720

Example 2: 4!

4! = 4 x 3 x 2 x 1 = 24

NOTE: Considering that all products have at least two factors, not
The symbols 0! and 1! make sense, but in order to apply the formulas to all
In these cases, the factorials of 0 and 1 are defined as 0! = 1 and 1! = 1.

Find the factorial of the following numbers

5! 6! 0! 8! 10! 3!
 Cartesian Product.
3.3.1 Definition. Let A and B be sets. The set formed by all
the ordered pairs of first component in A and second
component in B, it is denoted A x B and it is called Cartesian product
from A and B. Symbolically:

A x B = {(x, y) / x A y

Consequently:

(x, y) A x B x A y B

(x, y) A x B x A y B

In particular, as R is the set of real numbers, it holds that:

Rx R = {(x, y) / x R y R }.

Rx R is the set of all pairs of real numbers.

Geometric representation of Rx R is the Cartesian plane called
numeric plan also.

A one-to-one relationship is established between R x R and the set of

points of the geometric plane, associating in this way the ordered pair
(x, y) with the point P(x,y).

Example 1:

Set A = {1, 2} and B = {3, 4, 5} the Cartesian product A x B will be:

A x B = {(1, 3),(1, 4),(1, 5),(2, 3),(2, 4),(2, 5)}.

Example 2:

Sean A = {x / x R 1 x 3}
B = {x / x R 2
 x 2 }.

Its geometric representation is:

A x B is the set of points inside the rectangle PQRS and the

points that belong to the segments PQ and QR.

Example 3:

Sean A = {x / x N 1 x 4}, B = {x / x R 1 x 3}.

Represent A x B in the Cartesian plane.

Note: The definition of the Cartesian product can be generalized to the

product among n sets A1, A2,..., AnIn this case, to the set
formed by all the nordered dates (a1, a2,..., an) such that toi Ai
with i = 1, 2,..., n, is called the Cartesian product of A1, A2..., An and it
denotes A1x A2x ...xAn.

3.3.2 Properties of the Cartesian product.

3.3.2.1A X B Y AxB X x Y.

3.3.2.2A x B = 0 A = 0 B = 0.

3.3.2.3A B AxB 0 A x B Bx A.

3.3.2.4A x (B (A x B)(A x C)

3.3.2.5A x( B C) = (A x B) ( A x C ).

Demonstration of [Link]:
Suppose that A x B = 0. Reasoning by reduction to absurdity, if A 0 y
B 0; then there exist elements a and b such that a A and B B. Then the
couple (a,b) A x B, in contradiction with the hypothesis that A x B = 0.
Reciprocally, if A = 0, then A x B must equal 0 because if it happens that
Ax B 0, there will exist (a, b) A x B then a In contradiction with the
assumption that A = 0.
Similarly, the reasoning applies in the case where B = 0.

A x (B C) x A y
Demonstration of [Link]: (x, y) B C.
x A ( y B y C). ( x A y B) (x A y (x, y) A
x B (x, y) A x C. (x, y) (A x B) (A x C).

3.3.3 Number of elements in the Cartesian product. (Techniques of

counting). For finite sets A and B, we have:

AxB = A B .

since:

A x B = {(a, b): a A b B}.

and for each of the A there are elections in A B elections

from b to B to form the ordered pair (a, b).

Example 4. Let A = {1, 2, 3, 4} and B = {a, b, c}. Then A x B consists of

of 12 elements, which can be represented through a
table organized in the following way:

For the product of more than two sets, an identity holds.

similar.

[Link] Product Rules.

For finite sets A1, A2,..., Ak, it has:

k
A1x A2x ... xAn = Aj
j=1
 PERMUTATIONS AND COMBINATIONS
A permutation of objects involves order while a combination does not take it into account.
the order of the objects considered.

Definition:
Given a set that contains distinct elements X = {x1,x2, ....xn}

a) A permutation of X is an arrangement of the n elements x1,x2, ....xn

b) A permutation–r (or permutation) of X where n is an arrangement of a

subset of elements of X.

c) The number of permutations of a subset of distinct elements is

denotes P(n,r)

d) A combination-r (r-combination) is an unordered selection of

elements of X, that is, a subset of elements of X.

e) The number of combinations-r of a set of distinct elements and se

denotes C(n,r) or

Example:
SeaX= {a, b, c}
Algunas permutaciones deXson: abc, acb, bac
Algunas permutaciones-2 deXson: ab, ba, ca
Algunas combinaciones-2 deXson: {a, b}, {a, c}, {b, c}

Theorem:
The number of permutations of a set of distinct objects is

P(n,r) = (n)(n-1)(n-2)...(n-r+1)

The demonstration is direct by applying rule b) of the product.

By this theorem, the number of permutations-2 of X = {a, b, c} is 6, which

son: ab, ac, ba, bc, ca, cb

Also by this Theorem, the number of permutations in a set is

elements is

P(n,n) = (n)(n-1)(n-2)...(3)(2)(1) = n!
Example 2.

Carlos Pérez wants to go to Cancun or Playa del Carmen soon.

summer vacation, to go to Cancun, there are three means of transportation to go
to Mérida and 2 to go from Mérida to Cancún, and to go to Playa del Carmen from
Mérida has four different means of transportation:

a) How many different ways does Carlos have to go to Cancún or to Playa del
Carmen?

b) How many different ways does Carlos have to go to Cancun or Playa del
Carmen on a round trip, if she doesn't return by the same means of transport as she
What went away?

a) M = Ways to go to Cancun = 3 x 2 = 6

N = Ways to go to Playa del Carmen = 3 x 4 = 12

therefore

M + N = 6 + 12 = 18 ways

b) M = Ways to go to and return from Cancun = 3 x 2 x 1 x 2 = 12

N = Ways to go to and return from Playa del Carmen = 3 x 4 x 3 x 2 = 72

Therefore

M + N = 12 + 72 = 84
On the contrary, the formula for combinatorial numbers can be given the
general formula character of the triangle to know, without the need to construct
In all the previous rows, what is the number that occupies a certain place:

Pascal's Triangle and Newton's Binomial

The general formula of the so-called Binomial of Newton (a + b)nis formed by some
coefficients that match line number n+1 of Pascal's triangle (the one that
starts from 1 and n).

The formula is:

One way to avoid having to calculate all the coefficients one by one is to use
the Pascal's Triangle, since the coefficients of the power n appear in the
row n+1 of said triangle.

An example: applying the formula and the definition of combinatorial number

we would have
(a + b)3=1·a3+3·a2b + 3·ab2+1·b3.

But it would have been faster to go to row 4 (3 + 1) of the triangle and see that the
the numbers that appear are, precisely, the coefficients 1, 3, 3, and 1.

The properties of Pascal's triangle:

The difficult part is to look at this triangle for a couple of minutes and not find any.
hidden regularity.

Polygonal numbers

Could you tell which sequences form the diagonals of the

triangle? The first ones on the left and right are nothing more than ones.
The second forms the succession of natural numbers... And the third one?
And the fourth?

On the marked third diagonal, there appear

Triangular numbers

, but also in the immediate lower section appear the tetragonal numbers, it is
to say, those that form the triangular pyramids, whose layers are in turn
triangular numbers.
The square numbers

they are found in Pascal's triangle going down the same diagonal as in the
previous case: we build each one by summing two triangular numbers
consecutive. That gives us: 1, 4, 9, 16, 25, ...
In fact, with this recurrent method we can construct all the numbers.
polygonal, and in that sense they are present in Pascal's triangle.

Prime numbers
If the first element of a row is a prime number, all the numbers of
that row will be divisible by it (except for 1, of course). Thus, in row 7: (1 7 21 35
35 21 7 1), the numbers 7, 21, and 35 are divisible by 7.
The sum of the elements
The sum of the elements of any row is the result of raising 2 to the
number that defines that row. Thus:
20= 1
21= 1+1 = 2
22= 1+2+1 = 4
23= 1+3+3+1 = 8
24= 1+4+6+4+1 = 16

Fibonacci sequence

The Fibonacci series can also be found in the triangle of

Pascal. Dividing it according to the lines we showed in the
diagram, the numbers trapped between them each sum up to
elements of this sequence.
Let us remember that this succession (which, by the way, is constructed in a way
similar to Pascal's triangle), is:
1, 1, 2, 3, 5, 8, 13, 21,...
(an+1= an+ an-1cona0= 1, a1= 1)

Powers of 11
We can interpret each row as a unique number. If the row is formed
for single-digit numbers, just join them. In the case of row 2
we have:
1-2-1............................ 121 = 112
When the numbers in the row consist of more than one digit, they are 'distributed'.
to form the final number as observed in the following example for the
 line 5:
1-5-10-10-5-1........... 1-(5+1)-(0+1)-0-5-1=1-6-1-0-5-1 ............ 161051 = 11 5

Partition

Partition of the circle into 6 parts {A1, ... , A6}.

Inmathematics, a partition of asetA is thefamily of

subsetsAii∈ that meets the following conditions:

1. for everyone .

2. .
3. .

Therefore, it is about acoatingin which

thesubsetsbelonging to the family, two by two, aredisjoint(that is, your
intersection isempty).

There is an intimate relationship between partition andequivalence

relation, defined on
a single set A: the set of equivalence classes forms a partition
from A. And conversely, given any partition P of a set A, we can define a
equivalence relation where x ~ y if and only if they belong to the same subset
from partition P.

Examples
Every set containing an element {x} has exactly one partition: { {x} }.
 For any non-empty set X, P = {X} is a partition of X.
The set { 1, 2, 3 } has these 5 partitions:
o{ {1}, {2}, {3} }, sometimes noted as 1/2/3.
o{ {1, 2}, {3} }, sometimes noted as 12/3.
o{ {1, 3}, {2} }, sometimes noted as 13/2.
o{ {1}, {2, 3} }, sometimes noted as 1/23.
o{ {1, 2, 3} }, sometimes noted as 123.
Note that
o{ {}, {1,3}, {2} } is not a partition (since it contains the empty set

The number of partitions of a finite set

TheBell numberBtranslatedText, named in honor ofEric Temple Bellit is the number of
different partitions of a set with n elements. The first numbers of
Bell son: B0= 1, B1= 1, B2= 2, B3= 5, B4= 15, B5= 52, B6= 203
successionA000110inOEIS).

The Bell numbers satisfy the following relation

recursive .
 CONCLUSIONS
The teaching experience shows that the construction of associated concepts
counting is difficult for students; this work shows that these difficulties
they can be overcome through the design of a didactic strategy based on
theoretical considerations, in particular, in the APOE theory.

The topic of counting is introduced many times at the intermediate levels and
higher secondary: middle school and high school. The didactic work that was carried out in
this work does not require any prior knowledge from the students. By
therefore, the genetic decomposition developed for this experience could be
also useful for designing specific didactics for those levels. The
series of problems that were designed based on genetic decomposition
they could be used with students at these levels. The analysis of relevance,
relevance and effectiveness of this design could be the subject of a future
research.

It was found, in both experiences, that few students were able to detect the
cases. Differentiating different cases within the same problem implies, first
place, a deep understanding of the problem. Furthermore, this type of problems
requires strategies that are not easy to generalize, but rather a
experience that allows identifying the possibilities of choice within the
problem and classify them by types that are dealt with specifically.

The topic of counting is very broad. Often it is necessary to solve

problems that are separated into cases. It would be advisable to design a
genetic decomposition, based on what is proposed here, that would allow
identify the mental constructions of students when they approach this type
of problems.