WEBVTT
00:00:01.320 --> 00:00:06.880
Rupert has three wooden letters: an π΄, a π΅, and a πΆ.
00:00:06.880 --> 00:00:08.680
In how many different ways can he order all three letters?
00:00:10.440 --> 00:00:15.480
To answer this question, we should consider how many choices Rupert has for each letter.
00:00:15.480 --> 00:00:18.240
These three spaces represent the three positions for the letter.
00:00:19.760 --> 00:00:24.600
For the first letter, Rupert has all three letters available, so he has three choices.
00:00:25.960 --> 00:00:31.960
However, for the second letter, Rupert has already used one of the letters, so he only has two choices available.
00:00:33.560 --> 00:00:38.400
For the third letter, Rupert has already used two of the letters, so he only has one left.
00:00:38.400 --> 00:00:40.320
In fact, he doesnβt really have a choice at all.
00:00:40.320 --> 00:00:42.320
He has to use the last remaining letter.
00:00:44.120 --> 00:00:46.560
Now what do we do with these numbers?
00:00:46.560 --> 00:00:56.760
As any of the options for the first letter can be combined with either of the options for the second and then the one option for the third, we multiply these numbers together to give the overall number of possibilities.
00:00:58.600 --> 00:01:02.000
Three multiplied by two multiplied by one is equal to six.
00:01:02.200 --> 00:01:06.000
So there are six different ways that Rupert can order all three letters.
00:01:07.520 --> 00:01:14.640
In fact, as the number of letters in this question is quite small, we could also answer the question by listing out all of the possibilities.
00:01:16.200 --> 00:01:20.960
Rupert could start with an π΄ and then a π΅ and then a πΆ.
00:01:20.960 --> 00:01:25.720
Or he could swap the π΅ and the πΆ around, giving π΄πΆπ΅.
00:01:25.720 --> 00:01:28.000
These are the only two possibilities starting with the letter π΄.
00:01:29.640 --> 00:01:38.120
If Rupert starts with the letter π΅, he could have the word π΅π΄πΆ, or he could swap the order of the π΄ and the πΆ around.
00:01:38.720 --> 00:01:41.520
These are the only two possibilities beginning with the letter π΅.
00:01:43.160 --> 00:01:45.920
Finally, we consider the possibilities beginning with the letter πΆ.
00:01:46.320 --> 00:01:49.480
We could have πΆπ΄π΅.
00:01:49.480 --> 00:01:55.400
Or once again, Rupert could swap the final two letters around to give the word πΆπ΅π΄.
00:01:55.400 --> 00:01:57.680
And these are the only two possibilities beginning with the letter πΆ.
00:01:59.440 --> 00:02:01.720
So weβve written out the full list of possibilities.
00:02:01.720 --> 00:02:07.880
And by counting them, we can see once again that the number of different ways in which Rupert can order all three letters is six.
00:02:09.440 --> 00:02:16.240
This method of listing out all of the possibilities worked in this case as we only had a small number of choices for each letter.
00:02:16.240 --> 00:02:19.760
If we had a larger number of choices, this wouldnβt really be realistic.
00:02:19.760 --> 00:02:26.880
So weβd have to remember the rule of multiplying the number of choices for each letter together to give the total number of possibilities.