00:01
So in this question we have, we're going to be forming three digit numbers using the digits zero and one.
00:07
And repeated digits are allowed.
00:09
So we're going to be using the fundamental counting principle for this, the fcp.
00:15
Again, if you have a ways to do the first thing, b ways to do a second thing, you'll have a times b ways to do both things.
00:24
So we're going to apply that to this problem here.
00:28
And this time we have three digit numbers.
00:31
So we're going to be picking three different numbers out of the digits zero and one.
00:36
So three different digits and any of those digits can be zero or one.
00:41
So let's go ahead and figure out how many ways, or let's label this a, b, and c.
00:50
So as you guys can see, as in this problem here, we're going to be applying that property of the fcp that says that the fcp can, the fcp can, the fcp can, be applied to any number of events.
01:02
So it doesn't just have to be event a and event b.
01:05
You can have as many events as you want and as long as you just multiply all them together, you will find the total number of combinations or total number of outcomes.
01:15
So let's go ahead and figure out our a or our b and our c...