x
Menu

# Combinatorics

IISc Bangalore, , Prof. L. Sunil Chandran

Updated On 02 Feb, 19

##### 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 1: Pigeon hole principle - (Part 1)

4.1 ( 11 )

###### 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

#### 3.3

8 Ratings
55%
30%
10%
3%
2%
###### Comments

Sam

Excellent course helped me understand topic that i couldn't while attendinfg my college.

Reply

Dembe

Great course. Thank you very much.

Reply
Send