forked from abhusnurmath/592Notes
-
Notifications
You must be signed in to change notification settings - Fork 2
/
08_ProbUnions.tex
70 lines (50 loc) · 2.47 KB
/
08_ProbUnions.tex
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
\documentclass[12pt]{article}
\usepackage{amsfonts,amssymb}
\usepackage{amsmath}
\usepackage{amsthm}
\usepackage{hyperref}
\usepackage{graphicx}
\usepackage{listings}
%\documentstyle[12pt,amsfonts]{article}
%\documentstyle{article}
\setlength{\topmargin}{-.5in}
\setlength{\oddsidemargin}{0 in}
\setlength{\evensidemargin}{0 in}
\setlength{\textwidth}{6.5truein}
\setlength{\textheight}{8.5truein}
%
%\input ../adgeomcs/lamacb.tex
%\input ../mac.tex
%\input ../mathmac.tex
%
\input xy
\xyoption{all}
\def\fseq#1#2{(#1_{#2})_{#2\geq 1}}
\def\fsseq#1#2#3{(#1_{#3(#2)})_{#2\geq 1}}
\def\qleq{\sqsubseteq}
\newtheorem{theorem}{Theorem}
%cis51109hw1
%
\begin{document}
\begin{center}
\fbox{{\Large\bf Probability of Unions}}\\
\vspace{1cm}
\end{center}
\vspace{0.5cm}\noindent
\section*{Probability of unions}
Two events are mutually exclusive if they are disjoint (which is another way of saying that their intersection is empty).
Having done set theory we know how to count the elements of a set if the two are mutually disjoint.
Just applying that idea
$P(A \cup B) = P(A) + P(B)$.
\medskip
\textbf{Example}
Consider the situation in which files are stored on a distributed network that has 30 computers. Three copies of File 1 are stored at three distinct locations in the network, and three copies of File 2 are stored at three different locations in the network (locations for File 1 are different from locations for File 2). Suppose that there are 6 random computers that have failed. What is the probability that either file has been wiped out? Let $F_1$ be the event that all three copies of File 1 are gone and $F_2$ the event that all three copies of File 2 are gone. What is $P(F_1 \cup F_2)$?
First let us compute $P(F_1)$. Our sample space consists of all the possible ways in which 6 out of 30 computers can fail. That is the same as choosing 6 from 30 or $30 \choose 6$. For the event described, we need all 3 computers that hold $F_1$ to be wiped out but the remaining 3 failed computer could be any of the rest. So that is $27 \choose 3$ ways.
$P(F_1) = \frac{{27 \choose 3}}{{30 \choose 6}}$
$F_2$ in terms of the probability calculation is exactly the same. So $P(F_2) = P(F_1)$.
But is there a chance that both $F_1$ and $F_2$ happen? Indeed. If the 6 computers that fail are the $F_1$ and $F_2$ computers. Which can only happen in this 1 disastrous way.
Therefore,
\begin{align*}
P(F_1 \cup F_2) = \frac{2 \cdot \binom{27}{3}}{\binom{30}{6}} - \frac{1}{\binom{30}{6}}
\end{align*}
\end{document}