00:01
Okay, so here we'll let a, n, b, r recurrence relation for the number of sequences of length n with an even number of zeros.
00:11
These are bit sequences, ones and zeros.
00:14
Okay, so the first case is if our sequence, so if our sequence begins with a one, so it's one, and then zeros are ones thereafter for a total of length n.
00:32
Well, in order to have an even number of zeros, then any sequence of n -minus -one length with an even number of zeros would fit the bill for this case, right? so then in this case, it would be the number of different ways for a sequence with an even number of zeros of length n -minus -1, possible strings.
01:01
That's just one case.
01:03
That was case 1.
01:09
For case 2, we'll consider starting with 0 0s.
01:19
So this time our sequence has 2 zeros and then n other elements.
01:27
Now in this instance we have an even number of zeros already...