deletions | additions       diff --git a/untitled.html b/untitled.html  index eb06fdb..c2303d3 100644  --- a/untitled.html  +++ b/untitled.html 
...
problem in which order is not important and repetition is allowed.  Multichoosing is denoted \(\left(\binom{n}{k}\right)\) where \(\left(\binom{n}{k}\right)\) means the amount of ways to  choose length \(k\) multisets from a set of \(n\) objects. In general \(\left(\binom{n}{k}\right)\) is where we may  say “\(n\) multichoose \(k\).” Notice this is an analogy a resembalance  with the binomial coefficient \(\binom{n}{k}.\) data-equation="\left(\binom{n}{k}\right)">\(\left(\binom{n}{k}\right)\)