Too many exams asks its problems at different level.
There are many ways to count things. When the sample space is small, you can literally count on fingers. But when the number of sample point go beyond thousand, we tend to forget or recount some cases. Even after verifying we tend to ignore those mistakes. This course on permutations and combinations will make sure that you do understand which case you are counting more than once or which case you are missing.
I have divided this Course into 8 sections and lectures inside each sections. Each lecture will teach you about a concept and theorem followed by examples on those concepts. I have made sure that my approach is problem solving and not jargon. Following are the sections
1) Fundamental Counting Principle
2) Combination and Theorems
3) Permutations and theorems
4) Inclusion Exclusion Principle
5) Bijection Principle
6) Useful Identities
7) Counting using Generating functions
Each Subsection will have a set of video lectures followed by Assignments based on what is being taught in the section. Attempting
Assignment before moving to another section will be beneficial. Any doubts regarding the course can be asked in Q&A.
I hope you enjoy the course,
All the best
Who this course is for:
students preparing for competitive Exams like Olympiad stage-1, KVPY, JEE
Math Enthusiasts
programming enthusiasts




DOWNLOAD
uploadgig.com


rapidgator.net


nitro.download