Let $S = \{1, 2, 3, \ldots, n\}$ and $A = \{(a, b) \mid 1 \leq a, b \leq n\} = S \times S$. $A$ subset $B$ of $A$ is said to be a good subset if $(x, x) \in B$ for every $x \in S$. Then,the number of good subsets of $A$ is

  • A
    $1$
  • B
    $2^n$
  • C
    $2^{n(n-1)}$
  • D
    $2^{n^2}$

Explore More

Similar Questions

If $Q = \{x : x = \frac{1}{y}, \text{ where } y \in N\}$,then which of the following is true?

Which of the following are sets? Justify your answer.
The collection of all natural numbers less than $100$.

If $X = \{a, b, c, d\}$ and $Y = \{f, b, d, g\},$ find $X - Y$.

In each of the following,determine whether the statement is true or false. If it is true,prove it. If it is false,give a counterexample.
If $A \subset B$ and $B \in C,$ then $A \in C$.

Set $A$ has $m$ elements and Set $B$ has $n$ elements. If the total number of subsets of $A$ is $112$ more than the total number of subsets of $B$,then the value of $m \times n$ is

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo