Abstract
This chapter provides an overview of the basic knowledge of permutations and combination. It discusses the multiplication principle. If a set of objects can be separated or partitioned into k nonempty disjoint subsets, and if each of these subsets can be separated into m nonempty disjoint subsets, then the original set can be separated into km nonempty disjoint subsets. A permutation of a set of objects is a mapping of the set onto itself. A combination of a set of objects is an unordered selection of the objects. Repetitions may or may not be permitted. The chapter also discusses the Binomial Theorem, the Binomial Coefficients, the Multinomial Theorem (Extension of Binomial Theorem), and the Stirling's Formula.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
