Scribd
Upload
69 views1 page

6.1.1 The Multiplication Rule: A B C D 1 2 3

This document discusses different word problems involving permutations and combinations. It provides 10 examples calculating the number of possible outcomes for scenarios like traveling routes, selecting teams, and choosing items from groups. The key concept is that the multiplication rule is used to find the total number of ways to complete a multi-step process by multiplying the number of options at each individual step.

Uploaded by

Cikgu Fayruzz Naseer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
69 views1 page

6.1.1 The Multiplication Rule: A B C D 1 2 3

This document discusses different word problems involving permutations and combinations. It provides 10 examples calculating the number of possible outcomes for scenarios like traveling routes, selecting teams, and choosing items from groups. The key concept is that the multiplication rule is used to find the total number of ways to complete a multi-step process by multiplying the number of options at each individual step.

Uploaded by

Cikgu Fayruzz Naseer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

6.1.

1 The multiplication rule


1. There are 3 routes joining village A and village B
and 4 routes joining village B and village C. Find
the number of different ways of traveling from
village A to village C via village B.
[1!
. There are bus "om#anies that #rovide trans#ort
from town $ to town F and 3 bus "om#anies that
#rovide trans#ort from town F to town %. Find the
number of ways a #erson "an travel from town $ via
to town % via town F by ta&ing a bus.
['!
3. There are 3 boys and girls in a grou#. Find the
number of ways to #i"& a boy and a girl for a
(athemati"s )ui*.
['!
4. +im has to "hoose a shirt and a trouser from '
shirts and 4 trousers in his "u#board. Find the
#ossible number of ways he "an do this.
[4!
,. Team A whi"h "onsists of , #layers wishes to have
badminton mat"hes with team B whi"h "onsists of '
#layers. Find the number of different single mat"hes
that "an be held.
[3-!
'.
The diagram above shows "ards of a game. .f a
#layer is going to sele"t a letter "ard and a digit "ard/
find the number of different ways "an this be done.
[1!
0. 1ashim "an "hoose to go to offi"e by "ar or by bus.
Find the number of different ways 1ashim "an go to
s"hool for three "onse"utive wor&ing days.
[2!
2. A football team #lays four friendly mat"hes in a
month. Find the number of #ossible out"omes from
the four mat"hes.
[1'!
3. There are , (alays/ 3 Chinese and .ndians in a
grou#. Find the number of ways "an a (alay/ a
Chinese and an .ndian be "hosen from the grou#.
[3-!
1-.There are #ie"es of "a&es on #late A/ 3 #ie"es of
"a&es #late B and 4 #ie"es of "a&es on #late C. .f
a boy is going to sele"t a "a&e from ea"h #late/ find
the number of different ways "an this be done.
[4!
Permutations & Combinations 1
A B C 4 1 3

You might also like