What makes a number binomial?: Subsets

Let A = { a , b , c , d } A = \{a, b, c, d\} . Find the number of all subsets in A A . This includes an empty set.


The answer is 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.

3 solutions

We'll divide the number of subsets into 5 cases:

0 0 members : ( 4 0 ) = 1 \binom{4}{0} = 1

1 1 member: ( 4 1 ) = 4 \binom{4}{1} = 4

2 2 members: ( 4 2 ) = 6 \binom{4}{2} = 6

3 3 members: ( 4 3 ) = 4 \binom{4}{3} = 4

4 4 members: ( 4 4 ) = 1 \binom{4}{4} = 1

Thus there are 1 + 4 + 6 + 4 + 1 = 16 1 + 4 + 6 + 4 + 1 = \boxed{16}

It is also interesting to note that this is the sum of the 5th row of Pascal's triangle.

A Former Brilliant Member - 6 years, 11 months ago
Akagami Ng
Jun 20, 2014

It's relatively simple. A set with n elements have 2^n subsets. In this case, there are 4 elements, so 2^4=16.

Anurag Pandey
Sep 20, 2016

Every element has got 2 2 choices. Whether to be a part of subset or not .

So , by multylping we get 2.2.2.2 = 2 4 = 16 2.2.2.2 =2^4=16 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...