DLP Combinations
DLP Combinations
A. COMBINATORIC
S
Combinatorics
is the branch of
mathematics studying
the enumeration,
combination, and
permutation of sets of
elements and the
mathematical relations
that characterize their
properties.
Mathematicians
sometimes use the term
"combinatorics" to refer
to a larger subset of
discrete mathematics
that includes graph
theory.
A combination is a
mathematical technique
that determines the
number of possible
arrangements in a
collection of items where
the order of the selection
does not matter. In
combinations, you can
select the items in any
order. Combinations can
be confused with
permutations.
Scenario:
Suppose you were
assigned as the leader
and have the freedom to
choose 4 of your
classmates to be your
group mates. If you
choose Aira, Ferie,
Lorrea, and Daniel, does
it make any difference if
you choose Ferie,
Lorrea, Daniel, and Aira?
Of course not, because
the list refers to the
same people. Each
selection that you could
possible make is called
combination. On the
other hand, if you
choose Aira, Johana,
Shaina, and Jenilyn,
now that is another
combination, and it is
different from the first
combination cited.
Remember: If there is a
set S with n elements,
and if r is a nonnegative
integer less than or
equal to n, then each
subset of S containing r
distinct elements is
called a combination of
S.
The number of
combinations of n
objects taken r at a time
is denoted by
C(n,r)
Note:
There are 4 objects (A, B,
C, D). n=4
They are selected 3 at a
time. r=3
And so the equation
becomes C(4,3).
Formula:
P (n , r)
C(n,r) =
r!
n!
C(n,r) = ( n−r ) !
r!
n!
C(n,r) =
r ! ( n−r ) !
Example 1:
In how many ways
can a committee
consisting of 4 members
be formed from 8
people?
P (8 , 4)
C(8,4) =
4!
8!
C(8,4) = ( 8−4 ) !
4!
8!
C(8,4) =
4 ! ( 8−4 ) !
C(8,4) =
8 ∙7 ∙ 6 ∙5 ∙ 4 ∙ 3 ∙2 ∙ 1
4 ∙ 3 ∙2 ∙1 4 ∙3 ∙ 2∙ 1
7 ∙5 ∙ 2
C(8,4) =
1
C(8,4) = 70 ways
Example 2:
How many polygons
can be possibly formed
from 6 distinct points on
a plane, no three of 6 ∙5 ∙ 4
which are collinear.? N= +
3!
6 ∙5 ∙ 4 ∙ 3
Solution: The polygons +
may have 3, 4, 5 or 6 4!
vertices. Thus, the 6 ∙5 ∙ 4 ∙ 3 ∙2
+
number of N possible 5!
polygons is: 6 ∙5 ∙ 4 ∙ 3 ∙2 ∙ 1
6!
N = C(6,3) + C(6,4) +
C(6,5)+ C(6,6) N= (5x4)+(5x3)+6+1
N= 20+15+7
N= 42 possible
polygons
A permutation is an
act of arranging
objects or numbers
in order.
Combinations are
the way of selecting
objects or numbers
from a group of
objects or
collections, in such
a way that the order
of the objects does
not matter.
I. Evaluating EVALUATE Activity 2: Choose
learning Wisely, Choose Me
2. If there
are 7 distinct
points on a plane
with no three of
which are
collinear, how
many different
polygons can be
possibly formed?
3. From a population
of 50 households,
in how many ways
can a researcher
select a sample
with a size of 10?
1. Determining the
top of three
winners in a
Science Quiz Bee.
3. Forming triangles
from 7 given points
with no three of
which are
collinear.
4. Four people
posing for pictures.
5. Assembling a
jigsaw puzzle.