00:01
Hi, so here it was given that the drawer contains eight blue socks.
00:05
So i'm just writing that data over here.
00:07
So we have eight blue and six green, six green socks and 12 black socks.
00:15
So 12 black.
00:17
So this is what the box contains.
00:20
And the question was asked to find what is the smallest number of socks that must be taken from the drawer without looking into the socks to be certain of having two socks of the same color.
00:30
Now let's assume one scenario that is one is coming and picking one source from here so it can be either blue it can be either green it can be either black so let me just add blue like for blue i'll add b u so either it will be blue either it will be green either it will be black now the same second source we will take.
01:03
So this can be again a blue.
01:06
So if that is again a blue, then the condition is satisfied.
01:10
That is in two takes, this is satisfied.
01:13
But in worst case scenario, that is a favorable scenario.
01:17
In worst case scenario, the next one will be not the same...