text
stringlengths
0
205
factorial implementation that's way
align:start position:0%
factorial implementation that's way
faster than the recursive one that we've
align:start position:0%
faster than the recursive one that we've
align:start position:0%
faster than the recursive one that we've
seen before all right let's run
align:start position:0%
align:start position:0%
it and we'll see what we get so for 10
align:start position:0%
it and we'll see what we get so for 10
align:start position:0%
it and we'll see what we get so for 10
the estimated proba ility is
align:start position:0%
the estimated proba ility is
align:start position:0%
the estimated proba ility is
.11 now so as you can see the
align:start position:0%
.11 now so as you can see the
align:start position:0%
.11 now so as you can see the
estimates are really uh pretty
align:start position:0%
estimates are really uh pretty
align:start position:0%
estimates are really uh pretty
good once again we have this business
align:start position:0%
good once again we have this business
align:start position:0%
good once again we have this business
that for 100 we're estimating one when
align:start position:0%
that for 100 we're estimating one when
align:start position:0%
that for 100 we're estimating one when
the real answer is point many many many
align:start position:0%
the real answer is point many many many
align:start position:0%
the real answer is point many many many
nines but again this is sample
align:start position:0%
nines but again this is sample
align:start position:0%
nines but again this is sample
probability just means in the number of
align:start position:0%
probability just means in the number of
align:start position:0%
probability just means in the number of
Trials we did um everyone for 100 people
align:start position:0%
Trials we did um everyone for 100 people
align:start position:0%