Basics of set theory- 2

Find the number of subsets of a set A A containing 6 distinct elements.

64 63 96 32 128 31 127 16

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Mehul Arora
Feb 11, 2016

The number of subsets of a set A A containing n n elements is 2 n 2^n .

Simply applying the formula: Number of subsets = 64 \huge {\boxed {64}} .

It would be better if you include the proof of the first line in the solution.

Nihar Mahajan - 5 years, 4 months ago

Log in to reply

Yes, I agree with you Nihar.

Venkata Karthik Bandaru - 5 years, 4 months ago
Shanthanu Rai
Feb 18, 2016

Given any subset S of A, an element x of A has two possibilities.

1.x belongs to S.

2.x does not belong to S.

Therefore, using multiplication principle, we multiply 2 six times to get the answer. 2^6=64 (The same idea can be extended to a set with n elements).

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...