Excursion to Discrete Probability: Computing the Expected Minimum of k Random Elements from {1,...,n}

来自 上海交通大学 的课程
Discrete Mathematics
52 评分
52 评分
The Binomial Coefficient
The binomial coefficient (n choose k) counts the number of ways to select k elements from a set of size n. It appears all the time in enumerative combinatorics. A good understanding of (n choose k) is also extremely helpful for analysis of algorithms.


  • Dominik Scheder
    Dominik Scheder
    Assistant Professor
    The Department of Computer Science and Engineering