If a set A has n elements, then the total number of subsets of A is

No worries! We‘ve got your back. Try BYJU‘S free classes today!

n²

No worries! We‘ve got your back. Try BYJU‘S free classes today!

2ⁿ

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is C
2ⁿ

Number of subsets of A = $^{n} C_{0}$ + $^{n} C_{1}$ + .............+ $^{n} C_{n}$ = $2^{n}$

Suggest Corrections

Similar questions

Prove that the number of subsets of a set containing n distinct elements is $2^{n}$ for all $n ϵ N$ .

(2 n + 1)

n

Prove the following theorem:

The total number of subsets of a finite set containing n elements is 2ⁿ.

Join BYJU'S Learning Program