## Dr. J’s Guide to Combinations (without replacement)

Dr. J introduces combinations (without replacement) which is an unordered set of k elements taken from a set of n elements where elements cannot be repeated. He provides intuition behind the formula for combinations, which is n factorial divided by (n-k) factorial times k factorial. Namely, combinations (without replacement) are just permutations (without replacement) except …

Dr. J’s Guide to Combinations (without replacement) Read More »