SOLVER7 Study. Nothing Else.
2026 Board Paper Q36(i)

A school wants the students of class XII to do a project on ‘Sustainability’ keeping the world environment in mind. They select the student participants on the basis of an essay writing competition. 7 students out of 80 are selected for the project and are categorized into two sets such that :
Girl students belong to Set \(A =\{G_1, G_2, G_3, G_4\},\)
Boy students belong to Set \(B=\{B1, B2, B3\}.\) Based on the above information, answer the following questions :How many relations are possible from Set \(A\rightarrow\) Set \(B\ ?\)

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have 4 girls and 3 boys. A relation is just a way of deciding who can be paired with whom. Every possible pairing list comes from the full set of 12 boy-girl pairs. You can pick any combination of those 12 pairs — or even none at all. Each different selection you make counts as one relation. Since each of the 12 pairs can either be included or left out, you get 2 choices per pair, giving 2 multiplied by itself 12 times, which equals 4096 different possible relations.

Answer: The number of relations possible from set \(A\) to set \(B\) is \(2^{12} = 4096\).

📖 Number of Relations from Set A to Set B

Detailed Explanation

A relation from set \(A\) to set \(B\) is defined as any subset of the Cartesian product \(A \times B\). The Cartesian product \(A \times B\) is the set of all ordered pairs \((a, b)\) where \(a \in A\) and \(b \in B\). If a set has \(n\) elements, then the number of its subsets is \(2^n\). So, to count relations, we first count the number of elements in \(A \times B\), and then count how many subsets that product set has. Each such subset is one possible relation.

Formula Used

If \(n(A) = m\) and \(n(B) = n\), then \(n(A \times B) = m \times n\), and the number of relations from \(A\) to \(B\) is \(2^{m \times n}\).

Solution

  1. Step 1: Identify the number of elements in each set. Set \(A = \{G_1, G_2, G_3, G_4\}\) has \(n(A) = 4\) elements, and set \(B = \{B_1, B_2, B_3\}\) has \(n(B) = 3\) elements.
  2. Step 2: Find the number of elements in the Cartesian product \(A \times B\). Since each element of \(A\) pairs with each element of \(B\), we get \[n(A \times B) = n(A) \times n(B) = 4 \times 3 = 12.\] So there are 12 ordered pairs in \(A \times B\).
  3. Step 3: Recall that a relation from \(A\) to \(B\) is any subset of \(A \times B\). The number of subsets of a set with \(k\) elements is \(2^k\). Here \(k = 12\), so the number of relations is \[2^{n(A \times B)} = 2^{12}.\]
  4. Step 4: Compute the value if a number is needed. \[2^{12} = 4096.\] This means there are \(4096\) possible relations from set \(A\) to set \(B\).

Final Answer

The number of relations possible from set \(A\) to set \(B\) is \(2^{12} = 4096\).

Common Mistake

A common mistake is to compute the number of functions instead of relations, or to use \(n(A) \times n(B)\) itself (i.e. 12) as the answer. Remember: relations are all subsets of \(A \times B\), so the count is \(2^{12}\), not \(12\).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Count the elements in each set. Set \(A = \{G_1, G_2, G_3, G_4\}\) gives \(n(A) = 4\), and set \(B = \{B_1, B_2, B_3\}\) gives \(n(B) = 3\). — Reason: We need the sizes of both sets before we can compute the size of their Cartesian product.
  2. Step 2: Compute the number of ordered pairs in the Cartesian product \(A \times B\). Every element of \(A\) is paired with every element of \(B\), so \[n(A \times B) = n(A) \times n(B) = 4 \times 3 = 12.\] — Reason: The Cartesian product combines each element of \(A\) with each element of \(B\), so its size is the product of the individual set sizes.
  3. Step 3: Recall the definition of a relation. A relation from \(A\) to \(B\) is defined as any subset of \(A \times B\). — Reason: This connects the problem of counting relations directly to the problem of counting subsets, which has a well-known formula.
  4. Step 4: Apply the subset-counting rule. For any set with \(k\) elements, the total number of its subsets is \(2^k\). Since \(n(A \times B) = 12\), the number of possible relations is \[2^{12}.\] — Reason: Each of the 12 ordered pairs can either be included in a relation or excluded, giving 2 independent choices per pair, and hence \(2^{12}\) total combinations.
  5. Step 5: Evaluate the power. \[2^{12} = 4096.\] — Reason: Computing the numerical value gives the final count of all possible relations from \(A\) to \(B\).

Final Answer

The number of relations possible from set \(A\) to set \(B\) is \(2^{12} = 4096\).

Common Mistake

One common mistake: Students sometimes confuse \(n(A) + n(B)\) with \(n(A) \times n(B)\) when finding \(n(A \times B)\), writing \(2^{4+3} = 2^7 = 128\) instead of the correct \(2^{4 \times 3} = 2^{12} = 4096\).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \(n(A) = 4\), \(n(B) = 3\)
  2. Step 2: \[n(A \times B) = 4 \times 3 = 12\]
  3. Step 3: Number of relations \(= 2^{12} = 4096\)

Answer: The number of relations possible from set \(A\) to set \(B\) is \(2^{12} = 4096\).

➕ More Examples

More Examples

Example 1

Question: A sports club organises a tournament and selects 9 players divided into two teams. Team P (batting specialists) belongs to Set \( P = \{P_1, P_2, P_3, P_4, P_5\} \) and Team Q (bowling specialists) belongs to Set \( Q = \{Q_1, Q_2, Q_3\} \). How many relations are possible from Set \( P \) to Set \( Q \)?

Solution: Step 1: Find the number of elements in each set. Set \( P \) has \( m = 5 \) elements and Set \( Q \) has \( n = 3 \) elements. Step 2: Find the number of elements in the Cartesian product \( P \times Q \). \[ |P \times Q| = m \times n = 5 \times 3 = 15 \] Step 3: Each element of \( P \times Q \) can either belong or not belong to a relation. So the total number of subsets (relations) is: \[ \text{Number of relations} = 2^{15} = 32768 \]

Answer: \( 2^{15} = 32768 \)

Example 2

Question: A college library categorises its reference books into two groups. Fiction books belong to Set \( F = \{F_1, F_2, F_3\} \) and Non-fiction books belong to Set \( N = \{N_1, N_2, N_3, N_4\} \). How many relations are possible from Set \( F \) to Set \( N \)?

Solution: Step 1: Identify the number of elements in each set. Set \( F \) has \( m = 3 \) elements and Set \( N \) has \( n = 4 \) elements. Step 2: Compute the number of ordered pairs in the Cartesian product \( F \times N \). \[ |F \times N| = m \times n = 3 \times 4 = 12 \] Step 3: A relation from \( F \) to \( N \) is any subset of \( F \times N \). Since each of the 12 ordered pairs can independently be included or excluded, the total number of relations is: \[ \text{Number of relations} = 2^{12} = 4096 \]

Answer: \( 2^{12} = 4096 \)

🎯 Try a Similar Question

Try a Similar Question

Question: A sports club selects 8 members for an inter-school competition. These members are divided into two groups: Group P (Players) = \( \{P_1, P_2, P_3\} \) and Group Q (Support Staff) = \( \{Q_1, Q_2, Q_3, Q_4, Q_5\} \). How many relations are possible from Group P to Group Q?

Solution

  1. Step 1: Identify the number of elements in each set: Group P has \( m = 3 \) elements and Group Q has \( n = 5 \) elements.
  2. Step 2: Find the number of elements in the Cartesian product P × Q: The Cartesian product \( P \times Q \) consists of all ordered pairs \( (p, q) \) where \( p \in P \) and \( q \in Q \). The number of elements in \( P \times Q \) is \( m \times n = 3 \times 5 = 15 \).
  3. Step 3: Count the number of possible relations: A relation from P to Q is any subset of \( P \times Q \). Since \( P \times Q \) has 15 elements, and each element can either be included or not included in a relation, the total number of relations is \( 2^{15} \).
  4. Step 4: Compute the final answer: Evaluating the expression: \( 2^{15} = 32768 \).

Answer: The number of relations possible from Group P to Group Q is \( 2^{15} = 32768 \).

Everything you get with Solver7

More questions in Relations and Functions