Question:

Let $A$ and $B$ be finite sets and $P_{A}$ and $P_{B}$ respectively denote their power sets. If $P_{B}$ has $112$ elements more than those in $P_{A^{\prime}}$ then the number of functions from $A$ to $B$ which are injective is

Updated On: Apr 4, 2024
  • 224
  • 56
  • 120
  • 840
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is D

Solution and Explanation

Let $n(A)=m$ and $n(B)=n$. Then, according to the question, $ n(P(B))-n(P(A)) =112 $ $\Rightarrow 2^{n}-2^{m} =112 $ $\Rightarrow 2^{m}\left(2^{n-m}-1\right) =16 \times 7$ $\Rightarrow 2^{m}\left(2^{n-m}-1\right) =2^{4}\left(2^{3}-1\right) $ $\therefore m=4 $ and $ n-m =3$ $\Rightarrow m=4, n=7$ $\therefore$ Number of injective functions from $A$ to $B$ $={ }^{n(B)} P_{n(A)}={ }^{7} P_{4}=\frac{7 !}{3 !}=840$
Was this answer helpful?
0
0

Concepts Used:

Relations

A relation in mathematics defines the relationship between two different sets of information. If two sets are considered, the relation between them will be established if there is a connection between the elements of two or more non-empty sets. Therefore, we can say, ‘A set of ordered pairs is defined as a relation.’

Read Also: Relation and Function

Types of Relations:

There are 8 main types of relations which are:

  1. Empty Relation - An empty relation is one in which there is no relation between any elements of a set.
  2. Universal Relation - A universal is a type of relation in which every element of a set is related to each other. Now one of the universal relations will be R = {x, y} where, |x – y| ≥ 0. For universal relation, R = A × A
  3. Identity Relation - In an identity relation, every element of a set is related to itself only. For example, in a set A = {a, b, c}, the identity relation will be I = {a, a}, {b, b}, {c, c}.
  4. Inverse Relation - It is seen when a set has elements which are inverse pairs of another set. For example if set A = {(a, b), (c, d)}, then inverse relation will be R-1 = {(b, a), (d, c)}.
  5. Reflexive Relation - If every element of set A maps for itself, then set A is known as a reflexive relation.It is represented as a∈ A, (a,a) ∈ R.
  6. Symmetric Relation - A relation R on a set A is known as asymmetric relation if (a, b) ∈R then (b, a) ∈R , such that for all a and b ∈A.
  7. Transitive Relation - For transitive relation, if (x, y) ∈ R, (y, z) ∈ R, then (x, z) ∈ R. For a transitive relation, aRb and bRc ⇒ aRc ∀ a, b, c ∈ A
  8. Equivalence Relation - If a relation is reflexive, symmetric and transitive at the same time it is known as an equivalence relation.

Representation of Relations:

There are two ways by which a relation can be represented-

  1. Roster method
  2. Set-builder method

The roster form and set-builder for for a set integers lying between -2 and 3 will be-

Roster form

I= {-1,0,1,2}

Set-builder form

I= {x:x∈I,-2<x<3}