Permutation:
Permutation is a term used in mathematics to refer to the act of arranging all the members of a set in some sequence or order. In other words, if the set is already ordered, the method of permuting is used to rearrange its components. Permutations exist in almost every field of mathematics, in varying degrees of prominence. They sometimes arise when considering alternative orderings of such finite sets.
Combination:
Combinations are a way of choosing objects from a list in which the order of selection is irrelevant (unlike permutations). In smaller cases, the number of possible variations can be counted. Combination is the process of combining n distinct items k at a time without repetition. The words k-selection or k-combination with repetition are often used to refer to combinations that allow for repetition. Permutation and Combination in Class 11 is a critical subject that aids in achieving a high score on the Board Exams.
Difference Between Permutations And Combinations
Permutations and combinations are the different ways in which objects from a set may be selected in order to form subsets, usually without substitution. When the order of selection is a factor, this selection of subsets is referred to as a permutation; when the order is not a factor, it is referred to as a mixture. In the seventeenth century, French mathematicians Blaise Pascal and Pierre de Fermat accelerated the growth of combinatorics and probability theory examining the ratio of desired subsets to all possible subsets for numerous games of chance.
The definitions of and distinctions between permutations and combinations can be demonstrated considering the numerous ways in which a pair of objects can be chosen from five distinct objects. For example, the letters in alphabetical order: A, B, C, D, and E. When both the letters chosen and the order in which they were chosen are considered, the following twenty outcomes are possible:
Each of these twenty distinct potential combinations is referred to as a permutation. This collection of numbers is particularly called permutations of five objects taken two at a time, and the symbol of 5P2 is used to showcase the total number of potential permutations, which is alternatively known as “5 permute 2.” In general, if we can choose from n number of objects and permutations (P) are to be constructed with the utilization of k of the objects at a time, the symbol nPk is responsible for showcasing the number of possible permutations. A formula for evaluating it is as follows:
nPk = n!/(n k)!
The expression n! is known as the “n factorial”, which mentions that all consecutive positive integers between 1 and n are to be multiplied together, while 0! is equivalent tol 1. For instance, if five objects are taken two at a time, this formula yields the following number of permutations:
(With k equal to n, nPk equals n! Thus, there are 5! = 120 arrangements for 5 objects.)
For combinations, k objects are chosen at random from a collection of n objects to create non-ordered subsets. In comparison to the previous permutation example, the AB and BA subsets are no longer distinct selections; when these cases are eliminated, only ten distinct subsets remain—AB, AC, AD, AE, BC, BD, BE, CD, CE, and DE.
The number of such subsets is denoted the symbol nCk, which stands for “n choose k.” Given that k objects have k! arrangements, each choice of k objects has k! indistinguishable permutations; thus, dividing the permutation formula k! yields the following combination formula:
This is equivalent to the binomial coefficient (n, k) (the binomial theorem is known to contain these combinations are sometimes called k-subsets). For instance, the number of possible combinations of five items taken in pairs is:
The nPk and nCk formulas are referred to as counting formulas because they can be used to count the number of possible permutations or combinations in a given situation without listing them all.
Primary Uses Of Permutations And Combinations:
Permutations are primarily used for the list of data where the appropriate order of the data is crucial for example locks. On the other hand, combinations are generally used for an assortment of data where the order of its presentation does not matter. The key difference in both of these maths concepts is the requirement of order of numbers in them.
