Sir,how total number of proper subsets of every set with n elements is 2 to the power n-2?

Asked by sidhusid | 18th May, 2010, 07:14: AM

Expert Answer:

this can be connected to the binimial theorem easily .

the subserts of a given set S may have 0 elements, 1 element, 2 elements....n elements.

so number of subsets will be

c(n,0), c(n,1)...c(n,n)

sum of all these will be the same as the expansion of (1+1) whole raised to power n, which is eequal to 2 raised to n

hence the answer.

Answered by  | 18th May, 2010, 12:20: PM

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