by Dave Chamberlain <davec@[EMAIL PROTECTED]
>
Sep 9, 2005 at 03:11 PM
BlankMondragon <blankmondragon@[EMAIL PROTECTED]
> wrote:
: show disgrega duplica :many.throws
: [[1 1] [0 0] [1] [0 0] [1] [0] [1 1 1 1] [0] [1 1] [0 0 0] [1 1 1 1 1 1
: 1] [0] [1 1 1] [0] [1] [0] [1 1] [0 0] [1] [0] [1] [0] [1 1 1] [0 0 0 0
: 0] [1 1 1] [0 0 0 0 0] [1 1] [0 0 0] [1 1] [0] [1] [0] [1] [0 0] [1 1
: 1] [0 0] [1 1] [0 0] [1 1] [0 0] [1] [0] [1] [0] [1 1] [0 0] [1 1 1 1
: 1] [0] [1 1 1]]
Using the combinations formula (2 ^ 5 = 32) and saying that you're looking
for 2 of the combinations (all heads or all tails/all 0's all 1's)
you want 2 out of 32 or 2/32 = 1/16 = .0625 or 6.25%.
In looking at what you have above, you found 5 ones in a row 4 times
(you found 7 in a row, which has 3 groups of 5 in a row) and 5 zeroes
2 times, for a total of 6.
Got to love it when math works :-)
: show simul 5
: 0.975
: show simul 6
: 0.84
: show simul 7
: 0.548
: show simul 8
: 0.3
: show simul 9
: 0.15
: show simul 10
: 0.081
: Daniel
: http://mondragon.angeltowns.net/logofe/
: PS. This page is about a simulation of the Birthday paradox:
: http://mondragon.angeltowns.net/paradiso/Problema***pleanos.html
--
-davec
-----------------------------------------------------------------
--
submissions: post to k12.ed.math or e-mail to k12math@[EMAIL PROTECTED]
e-mail to the k12.ed.math moderator: kem-moderator@[EMAIL PROTECTED]
website: http://www.thinkspot.net/k12math/
newsgroup charter: http://www.thinkspot.net/k12math/charter.html