Remarks . From above ( ! C ! ! × , i.e., ! C ! ! r n In particular, if r , ! C ! ! = . . We define n C = , i.e., the number of combinations of n different things taken nothing at all is considered to be . Counting combinations is merely counting the number of ways in which some or all objects at a time are selected. Selecting nothing at all is the same as leaving behind all the objects and we know that there is only one way of doing so. This way we define n C = . .
📖 generic · CBSE Class 11 English medium · MATHEMATICS · Page 160poem
Remarks 1. From above (
Chapter 2: 4 P 2 = 4 C 2 ××××× 2! or ( · MATHEMATICS
Related topics
As (→® Fundamental principle of counting If an event can occur in m different→® The number of permutations of n different things taken r at a time, where→® The number of permutations of n different things, taken r at a time, where→® The number of combinations of n different things taken r at a time, denoted by→
Have a question about this topic?
Get an AI answer grounded in your actual textbook — with the exact page reference.
Ask AI about this topic →