##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Edge values)
C(n,0) = 1 for any n. There is exactly one way to choose nothing: choose nothing.
C(n,n) = 1. There is one way to choose all n items: take everything.
C(n,1) = n. Choosing one item from n gives n options. C(n,k) = 0 if k > n (cannot choose more items than exist).
