ABSTRACT
Chapter 2 deals with the technique of mathematical induction which is used for proving many standard results over natural numbers. Then, we discuss about the basis of counting, pigeonhole principle, permutations and combinations, and recurrence relation. These concepts are useful in the analysis of certain discrete time systems, analysis of algorithms, error-correcting code, etc. Also, the concept of generating function is discussed which is used to solve linear recurrence relations.
