document.write( "Question 1117962: In how many ways can a teacher choose one or more students from 6 eligible students? \n" ); document.write( "
Algebra.Com's Answer #733149 by ikleyn(52781)![]() ![]() You can put this solution on YOUR website! . \n" ); document.write( " \r\n" ); document.write( "The number of ways to select one or more students from 6 students is equal to the number of non-empty subsets in the set of 6 students.\r\n" ); document.write( "\r\n" ); document.write( "\r\n" ); document.write( "It is very well known fact that the set of N elements has\r \n" ); document.write( "\n" ); document.write( "Solved.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "-------------- \n" ); document.write( "For discussion and the proof of this fact 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( " |