00:01
In this question, we've given this word wasteful.
00:04
Take note that every letter is unique.
00:06
There is no repeat of a letter.
00:09
And we want to find the number of eight letter words that can be made if repetition of letters is allowed.
00:16
So i'm going to draw eight slots here.
00:21
For the first letter to put into the slot, we can take any of these eight letters.
00:28
So eight choose one.
00:32
Now, n in combinatorics is thumps, or eight.
00:35
Is plus.
00:37
So n, so there's times.
00:39
And for the second slot, again because repetition of letters is allowed, again we have eight letters, we choose one to put into this slot.
00:49
And so there's times again.
00:52
Same thing for the third slot.
00:54
Again, each choose one letter to put into this slot.
00:57
So so on so forth, all the way to the last slot is also eight choose one...