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

From the course by Shanghai Jiao Tong University
Discrete Mathematics
83 ratings
Shanghai Jiao Tong University
83 ratings
From the lesson
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.

Meet the Instructors

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

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.