{VERSION 4 0 "IBM INTEL NT" "4.0" }
{USTYLETAB {CSTYLE "Maple Input" -1 0 "Courier" 0 1 255 0 0 1 0 1 0 0 
1 0 0 0 0 1 }{CSTYLE "" -1 256 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 }
{CSTYLE "" -1 257 "" 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 }{PSTYLE "Normal
" -1 0 1 {CSTYLE "" -1 -1 "" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 }0 0 0 
-1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "" 0 256 1 {CSTYLE "" -1 -1 "" 0 1 
0 0 0 0 0 1 0 0 0 0 0 0 0 0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }}
{SECT 0 {EXCHG {PARA 256 "" 0 "" {TEXT -1 108 "Copy Machine Problem: W
ith 100 people, what are the odds that two people share the same four-
digit passcode?" }{MPLTEXT 1 0 0 "" }}}{EXCHG {PARA 0 "" 0 "" {TEXT 
256 410 "Procedure: Solve the problem finding the odds that two people
 do not share the same passcode, then find the complement of that resu
lt.  With 10,000 possible passcodes (0000-9999) two people would have \+
a 9999/10000 chance of not having the same, three people would have 99
99/10000 * 9998 / 10000 chance, etc.  This is an implementation of the
 Pi function, similar to the Sigma function in Maple and in calculus.
" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 83 "n := 1:\nfor i from 1 t
o 100 do\n  n := n * ((10001 - i) / 10000)\nend do:\nevalf(1-n);" }
{TEXT -1 0 "" }}}{EXCHG {PARA 0 "" 0 "" {TEXT 257 84 "What about 150 p
eople?  200 people?  Simply change the 100 above to reflect changes." 
}{MPLTEXT 1 0 0 "" }}}}{MARK "2 0 0" 83 }{VIEWOPTS 1 1 0 1 1 1803 1 1 
1 1 }{PAGENUMBERS 0 1 2 33 1 1 }