Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions src/content/questions/comp2804/2019-fall-final/8/solution.md
Original file line number Diff line number Diff line change
Expand Up @@ -2,12 +2,12 @@ I guess we can just think, "total possibilities minus possibilities where both O

<ul>
<li> Let S be the set of all possibilities <br/>
We choose 1 position out of the 5 positions for the B: 5 <br/>
We choose 2 position out of the 4 remaining positions for the O: $ \binom{4}{2} $ <br/>
We choose 1 position out of the 6 positions for the B: 6 <br/>
We choose 2 position out of the 5 remaining positions for the O: $ \binom{5}{2} $ <br/>
We choose 1 position out of the 3 remaining positions for the G: 3 <br/>
We choose 1 position out of the 2 remaining positions for the E: 2 <br/>
We choose 1 position out of the 1 remaining positions for the R: 1 <br/>
$ |S| = 5 \cdot \binom{4}{2} \cdot 3 \cdot 2 $
$ |S| = 6 \cdot \binom{5}{2} \cdot 3 \cdot 2 $
<li> Let A be the set of all possibilities where both O's are together <br/>
Let's treat the two O's as one letter <br/>
We have 5 letters: $ G, E, R, B, O $ <br/>
Expand Down