Of Notes

Combinatorics

1 min read · revised 8 October 2026 · referred to by 2 notes · ·

So imagine you are flipping a coin which has two faces (we call this unique outcomes).

If we flip it times we get ways this could turn out. This case is called with-replacement because each turn doesn't take away from the entire outcome space.

If however you consider a deck of cards (52) each time you lay one out on the table you subtract one from the space. If we draw cards we get a sequence like:

So if we wanted all the ways we could lay out our cards for the entire deck that would be . But what if we wanna constrain the we must divide by the difference:

Great, now we have all the possible ways of sampling form for some range . What if we dont care about the order tho? Well we just divide by again:

Formally we call this choose :

Choosing a formula for \(r\) draws from \(n\) outcomes: first ask whether draws are replaced, then whether order matters. The unordered with-replacement case (multisets) is \(\dbinom{n+r-1}{r}\).
Fig. 1. Choosing a formula for draws from outcomes: first ask whether draws are replaced, then whether order matters. The unordered with-replacement case (multisets) is .
/ or Ctrl K
search; empty, it shows notes to revise and lately read
m
mark this note to revise, or unmark it
c
cover maths, proofs and solutions to test yourself
n
uncover the next covered item
y
copy this note’s org-roam link
e
copy this note as markdown, LaTeX kept as TeX
p
the next problem to work; there h hints, s shows the solution, x passes it for today
→ ← j k space
turn the page, when reading in pages
l
on the map, trace the greatest distance, then the longest path
double-click
a formula, to copy its TeX
rest on maths
bind a part of a formula and open the wheel of notes it comes from; scroll or ↑ ↓ widens it, 1–6 goes
?
this card