Home
Class 12
MATHS
Let X be a set with exactly 5 element...

Let `X` be a set with exactly 5 elements and `Y` be a set with exactly 7 elements. If `alpha` is the number of one-one function from `X` to `Y` and `beta` is the number of onto function from `Y` to `X` , then the value of `1/(5!)(beta-alpha)` is _____.

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem, we need to find the values of \( \alpha \) (the number of one-one functions from set \( X \) to set \( Y \)) and \( \beta \) (the number of onto functions from set \( Y \) to set \( X \)), and then compute the expression \( \frac{1}{5!}(\beta - \alpha) \). ### Step 1: Calculate \( \alpha \) (Number of one-one functions from \( X \) to \( Y \)) 1. **Understanding one-one functions**: A one-one function means that each element of \( X \) must map to a unique element in \( Y \). Since \( X \) has 5 elements and \( Y \) has 7 elements, we can choose any 5 elements from \( Y \) to map to the elements of \( X \). 2. **Choosing elements from \( Y \)**: The number of ways to choose 5 elements from 7 is given by the combination formula: \[ \binom{7}{5} = \frac{7!}{5! \cdot (7-5)!} = \frac{7!}{5! \cdot 2!} = \frac{7 \times 6}{2 \times 1} = 21 \] 3. **Arranging the chosen elements**: Once we have chosen 5 elements from \( Y \), we can arrange them in \( 5! \) ways. Therefore, the total number of one-one functions \( \alpha \) is: \[ \alpha = \binom{7}{5} \times 5! = 21 \times 120 = 2520 \] ### Step 2: Calculate \( \beta \) (Number of onto functions from \( Y \) to \( X \)) 1. **Understanding onto functions**: An onto function means every element of \( X \) must be mapped to by at least one element of \( Y \). 2. **Total functions from \( Y \) to \( X \)**: The total number of functions from \( Y \) (7 elements) to \( X \) (5 elements) is: \[ 5^7 \] 3. **Using the principle of inclusion-exclusion**: We need to subtract the cases where at least one element of \( X \) is not mapped to. We can calculate the number of onto functions using the formula: \[ \beta = \sum_{k=0}^{5} (-1)^k \binom{5}{k} (5-k)^7 \] where \( k \) is the number of elements in \( X \) that are not used. - For \( k = 0 \): \( \binom{5}{0} \cdot 5^7 = 1 \cdot 78125 = 78125 \) - For \( k = 1 \): \( \binom{5}{1} \cdot 4^7 = 5 \cdot 16384 = 81920 \) - For \( k = 2 \): \( \binom{5}{2} \cdot 3^7 = 10 \cdot 2187 = 21870 \) - For \( k = 3 \): \( \binom{5}{3} \cdot 2^7 = 10 \cdot 128 = 1280 \) - For \( k = 4 \): \( \binom{5}{4} \cdot 1^7 = 5 \cdot 1 = 5 \) - For \( k = 5 \): \( \binom{5}{5} \cdot 0^7 = 1 \cdot 0 = 0 \) Now, applying inclusion-exclusion: \[ \beta = 78125 - 81920 + 21870 - 1280 + 5 - 0 = 16800 \] ### Step 3: Calculate \( \frac{1}{5!}(\beta - \alpha) \) 1. **Substituting the values**: \[ \beta - \alpha = 16800 - 2520 = 14280 \] 2. **Calculating \( \frac{1}{5!}(\beta - \alpha) \)**: \[ \frac{1}{5!}(14280) = \frac{14280}{120} = 119 \] ### Final Answer The value of \( \frac{1}{5!}(\beta - \alpha) \) is \( \boxed{119} \).

To solve the problem, we need to find the values of \( \alpha \) (the number of one-one functions from set \( X \) to set \( Y \)) and \( \beta \) (the number of onto functions from set \( Y \) to set \( X \)), and then compute the expression \( \frac{1}{5!}(\beta - \alpha) \). ### Step 1: Calculate \( \alpha \) (Number of one-one functions from \( X \) to \( Y \)) 1. **Understanding one-one functions**: A one-one function means that each element of \( X \) must map to a unique element in \( Y \). Since \( X \) has 5 elements and \( Y \) has 7 elements, we can choose any 5 elements from \( Y \) to map to the elements of \( X \). 2. **Choosing elements from \( Y \)**: The number of ways to choose 5 elements from 7 is given by the combination formula: \[ ...
Doubtnut Promotions Banner Mobile Dark
|

Topper's Solved these Questions

  • RELATION, FUNCTION & ITF

    RESONANCE ENGLISH|Exercise JEE MAIN|15 Videos
  • RELATION, FUNCTION & ITF

    RESONANCE ENGLISH|Exercise HLP_TYPE|38 Videos
  • RELATION, FUNCTION & ITF

    RESONANCE ENGLISH|Exercise COMPREHENSION_TYPE|6 Videos
  • NUMBER THEORY

    RESONANCE ENGLISH|Exercise Exercise -2 (PART - II)|4 Videos
  • SEQUENCE & SERIES

    RESONANCE ENGLISH|Exercise EXERCISE -2 (PART-II : PREVIOUSLY ASKED QUESTION OF RMO)|3 Videos

Similar Questions

Explore conceptually related problems

If the set A contains 7 elements and the set B contains 10 elements, then the number of one-one functions from A to B is

If the set A contains 5 elements and the set B also contains 5 elements, then find the number of bijective functions from A to B.

Knowledge Check

  • Let A be any finite set having n elements. Then number of one - one function from A to A are

    A
    ` n^(2)`
    B
    ` n!`
    C
    ` 2n `
    D
    None of these
  • If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is

    A
    720
    B
    120
    C
    0
    D
    None of these
  • Let A be a finite set containing 3 elements, then the number of functions from A to A is

    A
    512
    B
    511
    C
    27
    D
    26
  • Similar Questions

    Explore conceptually related problems

    Let A be a set of n distinct elements. Then the total number of distinct function from AtoA is ______ and out of these, _____ are onto functions.

    The total number of onto functions from the set {1,2,3,4) to the set (3,4,7) is

    If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is 720 (b) 120 (c) 0 (d) none of these

    If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is (a) 720 (b) 120 (c) 0 (d) none of these

    If the set A contains 7 elements and the set B contains 10 elements, then the number of one-one functions from A to B is (a) 10C7 (b) 10C7 x 7! (c) 7^(10) (d) 10^7