This commit is contained in:
2023-12-09 18:17:22 -08:00
parent a5362a2eb9
commit 6a5e02a8ac
27 changed files with 36 additions and 33 deletions

View File

@ -7,7 +7,7 @@ This means that the sets $\{1, 2, 3\}$ and $\{3, 2, 1\}$ are identical.
\definition{}
A \textit{graph} $G = (N, E)$ consists of two sets: a set of \textit{vertices} $V$, and a set of \textit{edges} $E$. \par
Verticies are simply named \say{points,} and edges are connections between pairs of vertices. \par
Vertices are simply named \say{points,} and edges are connections between pairs of vertices. \par
In the graph below, $V = \{a, b, c, d\}$ and $E = \{~ (a,b),~ (a,c),~ (a,d),~ (c,d) ~\}$.
\begin{center}

View File

@ -252,7 +252,7 @@
\problem{}
A pharmaceutical study shows that a new drug causes negative side effects in 3 of every 100 patients.
To check the number, a researcher chooses 5 random people to survey.
Assuming the study is accurate, what is the probabilty of the following? \\
Assuming the study is accurate, what is the probability of the following? \\
\begin{enumerate}
\item None of the five patients experience side effects.