Explain proof for the total number of all subsets of containing n elements is 2n.

Asked by  | 9th Apr, 2008, 03:23: PM

Expert Answer:

To explain this theorem

Let us consider a set  A consisting of 5 elements.

n(A)=5.

 No. Of Subsets containing no element=5C0

 No. Of Subsets  containing  1 elements=5C1

No of subsets containing 2 elements=5C2

No of subsets containing 3 elements=5C3

No of subsets containing 4 elements=5C4

No of subsets containing 5 elements=5C5

 

5C0+5C1+5C2+5C3+5C4+5C5= 32   = 25

Hence proved.....

Answered by  | 9th Apr, 2008, 05:29: PM

Queries asked on Sunday & after 7pm from Monday to Saturday will be answered after 12pm the next working day.