Grade 10 Combinations
Grade 10 Combinations
Learning Objectives
a. define combination;
b. differentiate permutations and combinations; and
c. solve problem involving combinations.
PERMUTATIONS
❏ A permutation is an arrangement of items in a particular
order. Notice, ORDER MATTERS!
❏ To find number of permutation of n items, we can use
Fundamental Counting Principle or Factorial Notation.
❏ Fundamental Counting Principle can be used
determined the number of possible outcomes when
there are two or more characteristics.
PERMUTATIONS
where 0 ≤ r ≤ n.
COMBINATIONS
COMBINATIONS
❏ A combination is an arrangement of items in which
ORDER DOES NOT MATTER!
❏ It is a number of ways of selecting from a set when the
order is not important.
❏ Since the order does not matter in combinations, there
are fewer combinations that permutations. The
combinations are a “subset” of the permutations.
❏ Subset is a set of which all the elements are contained
in another set.
COMBINATIONS
❏ To find the number of combinations of n items chosen r
at a time, we can use the formula;
where 0 ≤ r ≤ n.
where 0 ≤ r ≤ n.
Math can open your mind!
Let us consider the following problems involving
combinations.
Example 1. The players were numbered as 1, 2, and 3, how many
teams of two players can be formed?
Thus, 70 ways.
Practice No. 2
Thus, 45 groups.
Practice No. 3