Combinatorics

IISc Bangalore Course , Prof. L. Sunil Chandran

246 students enrolled

Overview

Pigeon hole Principle - Elementary Concepts - Elementary concepts and basic counting principles - Elementary concepts; Binomial theorem; Bijective proofs - Properties of binomial coefficients; Combinatorial identities - Permutations of multisets - Multinomial Theorem, Combinations of Multisets - Bounds for binomial coefficients - Sterlings Formula, Generalization of Binomial coefficients - Double counting;Some Techniques:Double counting - Halls Theorem for regular bipartite graphs; Inclusion exclusion principle - Recurrence relations and generating functions:Recurrence Relations - Generating functions - Solving recurrence relations using generating functions - Exponential generating functions - Special numbers - Partition Number - Catalan Numbers - Difference Sequences - Sterling Numbers

Lecture 36: Partition Number - Part (4); Catalan Numbers - Part (1)

Up Next
You can skip ad in
SKIP AD >
Advertisement
      • 2x
      • 1.5x
      • 1x
      • 0.5x
      • 0.25x
        EMBED LINK
        COPY
        DIRECT LINK
        PRIVATE CONTENT
        OK
        Enter password to view
        Please enter valid password!
        0:00
        0 (0 Ratings)

        Lecture Details

        Combinatorics by Dr. L. Sunil Chandran,Department of Computer Science and Engineering,IISc Bangalore.For more details on NPTEL visit httpnptel.ac.in

        LECTURES



        Review


        0

        0 Rates
        1
        0%
        0
        2
        0%
        0
        3
        0%
        0
        4
        0%
        0
        5
        0%
        0

        Comments Added Successfully!
        Please Enter Comments
        Please Enter CAPTCHA
        Invalid CAPTCHA
        Please Login and Submit Your Comment

        LECTURES