Hat drawing experiments. Subsets/Combinations with and without replacement

Contents of hat:    n=

Draw this many times:

    

With replacement Without replacement (subset)
     

a b c d e f g h i j



#(unordered) samples without replacement = #subsets = #combinations = C(N,n) = N! / (N-n)!n!
N=10,  n=5      C(10,5) = 252
N=100, n=10     C(100,10) ≈ 17.3T

#(unordered) samples with replacement = #combinations with replacement = C(N+n-1,n) = C(N+n-1,N-1)
N=10,  n=5      C(14,5) = C(14,9) = 2002
N=100, n=10     C(109,10)=C(109,99) ≈ 42.6T