00:01
So in part a, if we're dealing with the macro state 1, then that means that the longest string of consecutive h's or t's is 1.
00:15
So that would then mean that the most we ever have in a row is just one.
00:20
So if we think about the different ways that that could occur, that would have to be tails, heads, tails, heads, tails, heads, dot, dot, dot, 20 times.
00:29
Now, because there are an even number of data points here or an even number of flips, we would have that whatever state we started in, we would end in the opposite.
00:44
And then the other possibility would be starting with heads, and then having heads, tails, heads, tails, heads, ends, ending in heads, heads, and then tails.
00:58
So we can see that there are only two different possible microstates corresponding to the macro state one.
01:06
Then for macro state 20, we'll just say m state equals 20, then, well, that would have to mean that we have a string of 20 consecutive, for instance, heads, or 20 consecutive tails.
01:25
So that would mean that we would have two different possible, microstates corresponding to the macro state 20.
01:37
Now for the macro state 19, the way that we can think of this here is we have a particular, basically we have one choice of which facing or which result is it that gets repeated 19 times.
01:59
So it could be heads that gets repeated 19 times.
02:02
So we have one tails that shows up, and then it's just going to be dependent on if that tails is happening at the beginning or at the end.
02:16
So we could have heads, then heads, heads, heads, heads, heads, ending in tails, or tails, then heads, heads, heads, ending in heads.
02:26
But similarly, we could have, pardon me, we could have heads and then tails, tails, tails, tails, tails, tails, tails, tails, ending in tails, or, uh, pardon me, tails, then, or excuse me, yeah, that should be tails, then tails, tails, tails, tails, ending in heads.
02:52
So we can see that there are four different possible microstates corresponding to the macro state 19.
02:59
Now for part b, i'll jump over into excel and simulate this by well, direct simulation.
03:05
What i'll do is, first set up a discrete probability table where we just have heads and tails, then go to data analysis, random number generation, okay, number of variables.
03:21
Well, i'll do this for 100 runs of 20 each time.
03:29
Value and probability range, i put in there, hit okay.
03:34
Oh, whoops.
03:36
So in this case, it's yelling at me because it doesn't want non -numerical values, so i'll say there's zero or one.
03:45
Oops, not solver.
03:46
I want to put that into data analysis, random number generation, discrete.
03:52
Or technically, we could do this as a whole bunch of bernoulli's.
03:56
Actually, yeah, we could do this as a whole bunch of bernoulli's really easily.
03:59
So, in this case now, we have our different, our 100 different runs of our 20 different bernoulli trials.
04:09
Now, for figuring out the number or the maximum number of consecutive events, all right, now figuring out the number of consecutive events in excel is going to be a little bit tricky.
04:20
There are a few different ways that we can do this, but the approach that i'll take here is to write equals if...