document.write( "Question 1119364: in how many ways can one invite one or more of five friends to her a party? \n" ); document.write( "

Algebra.Com's Answer #734888 by ikleyn(52781) $\"\"$ $\"About$

You can put this solution on YOUR website!
.
\n" ); document.write( "

\r\n" );
document.write( "The number under the question = the number of all non-empty sub-sets of the set of 5 elements.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Answer.  In  = 32-1 = 31 way.\r\n" );
document.write( "

\r
\n" ); document.write( "\n" ); document.write( "--------------\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "The solution uses well known fact that the total number of subsets of a given set of N elements is $\"2%5EN\"$ , including the empty subset and improper subset.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "See the lesson\r
\n" ); document.write( "\n" ); document.write( " - How many subsets are there in a given finite set of n elements?\r
\n" ); document.write( "\n" ); document.write( "in this site.\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( " \n" ); document.write( "

\n" );