Consider the set of English alphabets: $\Omega = \{A, a, B, b, \dots, Z, z\}$. Find $n(\Omega)$.

Question

Consider the set of English alphabets: $\Omega = \{A, a, B, b, \dots, Z, z\}$. Find $n(\Omega)$. Find the number of subsets of $\Omega$. Find the number of proper subsets of $\Omega$. Find the number of subsets of $\Omega$ that contain neither $X$ nor $x$.

Accepted Answer

(i) $52$ (ii) $2^{52}$ (iii) $2^{52}-1$ (iv) $2^{50}$

IP2U10 HOT Q1

IP2U10 HOT Q1

Video Solution:

Solution:

Solution locked