Question
For any natural numbers n and k, prove that .
Answer :
Word Count : 321
______ _________ ______ ______ ________ __________ _________ __________ ___ ______ __________.
_____ _________ ______ _________ ___ ______ _____ _____ ______ _______ __________.
______ _______ __________ __________ _________ __________ _____ ________ __________.
________ _________ ______ _________ _____ ________ _______ ______.
_________ __________ _____ ___ ________ ___ ______ _________.
_________ ____ _________ ___ _____ __________ _____ __________ _____.
_____ ____ ____ _________ ______ _____ ___ ______.
__________ _______ ___ ______ ___ ___ ________.
________ ___ _________ _________ ______ ______ ______ ________.
_____ _____ _______ _____ ________ ________ _______ __________.
________ ________ _______ ___ _______ _______ _______ ___ __________.
____ _______ _________ ________ ___ ______ __________ ________.
________ ________ ________ _____ ___ ________ ____.
________ ______ ____ ______ __________ __________ _____ _________ ________ _____ ________ _________.
________ _________ ____ _____ ___ _______ ____ _________ ______ _________ ___ _______.
__________ __________ ___ _____ _______ ____ ____ ____ _________ _______ _______ ________.
_________ ________ ____ ______ ____ ________ _________ _______ ____ _______ ____.
_____ ______ ________ ____ ____ _________ ____.
________ ____ ____ ___ _______ ___ _______ ____ _________.
___ ________ __________ _____ ______ ____ _________ ___.
_________ ______ ____ ________ ______ _____ ______ _________ _______ ______ ____ ___.
_____ ______ __________ _________ ____ ______.
__________ ______ ______ _________ ___.
Skip in 10
We need to prove that for any natural numbers (n) and (k), [ P_n^k = P_{n-1}^{k-1} + P_{n-k}^k, ] where (P_n^k) denotes the number of permutations of (n) objects taken (k) at a time. By definition, [ P_n^k = \frac{n!}{(n-k)!}. ] Consider a set of (n) distinct objects. To form a permutation of (k) objects: 1. Case 1: Choose a specific object (say the first object) to be in the first position. Then, we need to select the remaining (k-1) objects from the remaining (n-1) objects. The number of ways to do this is (P_{n-1}^{k-1}). 2. Case 2: Do not include that specific object in the permutation. Then all
_____ ______ _______ ____ _____ _________ _______.______ _________ ______ ______ ________ __________ _________ __________ ___ ______ __________.
_____ _________ ______ _________ ___ ______ _____ _____ ______ _______ __________.
______ _______ __________ __________ _________ __________ _____ ________ __________.
________ _________ ______ _________ _____ ________ _______ ______.
_________ __________ _____ ___ ________ ___ ______ _________.
_________ ____ _________ ___ _____ __________ _____ __________ _____.
_____ ____ ____ _________ ______ _____ ___ ______.
__________ _______ ___ ______ ___ ___ ________.
________ ___ _________ _________ ______ ______ ______ ________.
_____ _____ _______ _____ ________ ________ _______ __________.
________ ________ _______ ___ _______ _______ _______ ___ __________.
____ _______ _________ ________ ___ ______ __________ ________.
________ ________ ________ _____ ___ ________ ____.
________ ______ ____ ______ __________ __________ _____ _________ ________ _____ ________ _________.
________ _________ ____ _____ ___ _______ ____ _________ ______ _________ ___ _______.
__________ __________ ___ _____ _______ ____ ____ ____ _________ _______ _______ ________.
_________ ________ ____ ______ ____ ________ _________ _______ ____ _______ ____.
_____ ______ ________ ____ ____ _________ ____.
________ ____ ____ ___ _______ ___ _______ ____ _________.
___ ________ __________ _____ ______ ____ _________ ___.
_________ ______ ____ ________ ______ _____ ______ _________ _______ ______ ____ ___.
_____ ______ __________ _________ ____ ______.
__________ ______ ______ _________ ___.
IGNOU ACADEMY
Your IGNOU journey, made easier.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
Continue Reading — It's Free
Sign in with Google to unlock more of this answer.
✓ Free access
✓ Unlock up to 60% of the answer
✓ No payment required
✓ Unlock up to 60% of the answer
✓ No payment required
Quick Google sign-in. No separate registration form.