Question 465470
<font face="Times New Roman" size="+2">


The proper subsets of a set are all subsets, including the null set, except the one subset that is identical to the given set.


You need the number of ways to select 0 things from 3 things, plus


The number of ways to select 1 thing from 3 things, plus


The number of ways to select 2 things from 3 things, but exclude


The number of ways to select 3 things from 3 things.


*[tex \LARGE \ \ \ \ \ \ \ \ \ \ \left(3\cr 0\right\)\ +\ \left(3\cr 1\right\)\ +\ \left(3\cr 2\right\)]


Where *[tex \LARGE \left(n\cr k\right\) ] is the number of combinations of *[tex \Large n] things taken *[tex \Large k] at a time and is calculated by *[tex \Large \frac{n!}{k!(n\,-\,k)!}]


Hint:  Look at the 4th row of Pascal's triangle, and exclude the last element.


Now that you know the total number of proper subsets, you can determine if you have listed all of them and you can determine if you have made any duplications.


John
*[tex \LARGE e^{i\pi} + 1 = 0]
My calculator said it, I believe it, that settles it
<div style="text-align:center"><a href="http://outcampaign.org/" target="_blank"><img src="http://cdn.cloudfiles.mosso.com/c116811/scarlet_A.png" border="0" alt="The Out Campaign: Scarlet Letter of Atheism" width="143" height="122" /></a></div>
</font>