00:01
In this problem, it is said that in a certain lottery game, a player picks six numbers from 1 to 46.
00:06
We need to determine how many different ways there are for the player to pick 6 numbers if order doesn't matter.
00:13
So from the numbers 1 to 46, any 6 numbers need to be selected.
00:18
So from 1 to 46, that's the total of 46 numbers.
00:22
Out of those 46 numbers, any 6 numbers need to be selected at random.
00:26
And this can be done in 46c6 ways.
00:29
Here we use c, which represents combination, and we use combination and not permutation in this case, because it is said that the order of the number selected does not matter.
00:39
So we just need to calculate this.
00:42
For that, recall the formula for n -c -r, that is given by n factorial by r -factorial times n minus r -factorial...