WEBVTT
00:00:02.000 --> 00:00:07.720
Timothy’s password must be five characters long.
00:00:08.720 --> 00:00:15.920
He can use zero to nine and he cannot use the same digit more than once.
00:00:16.680 --> 00:00:21.560
How many different passwords could Timothy create?
00:00:22.800 --> 00:00:25.800
Timothy has to make five choices.
00:00:26.360 --> 00:00:34.320
The first digit of his password can be anything from zero to nine, so how many options does he have?
00:00:35.320 --> 00:00:44.080
The sample space there is ten, zero plus all nine of those digits, ten choices.
00:00:45.080 --> 00:00:47.960
For the second character, something changes.
00:00:48.600 --> 00:00:55.040
We no longer have ten options to choose from because we’ve already used one of the digits in our first character.
00:00:55.600 --> 00:01:00.920
We now only have nine options available to us to choose from.
00:01:02.120 --> 00:01:12.600
After that, since he can’t repeat digits, he’ll have eight choices, followed by seven choices and then six choices.
00:01:13.680 --> 00:01:20.440
This progression is because order is important and he cannot repeat any digit.
00:01:21.920 --> 00:01:25.960
To solve from here, we’ll need to remember the fundamental counting principle.
00:01:27.000 --> 00:01:42.520
If event M has 𝑚 possible outcomes and event N has 𝑛 possible outcomes, then event M followed by event N has 𝑚 times 𝑛 possible outcomes.
00:01:43.840 --> 00:01:54.720
We have five events and we know how many possible outcomes for each event there are, which means what we need to do is we need to multiply the possible outcomes from each event.
00:01:55.840 --> 00:02:03.720
When you multiply ten times nine times eight times seven times six, it equals thirty thousand two hundred and forty.
00:02:04.440 --> 00:02:10.080
These are the amount of different passwords that Timothy could create.