Maths, Functionx, Mathematics, Mathematics Education, Discrete Mathematics.
element with k subset without resorting to the Binomial Theorem . First, consider a single ­element set {a1}. We have 1 way to choose zero elements, 1 way to choose one element, and 0 ways to choose more than one element. Similarly, generating function to choose n elements from the set {a2} is 1 +