document.write( "Question 361820: Formulas: nCr = n! / r!(n-r)! Order not Imp.....
\n" ); document.write( "
\n" ); document.write( " nPr = n! / (n-r)! Order is Imp....
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "Problem 1 (2 Points)
\n" ); document.write( "
\n" ); document.write( "You are at a mountain resort and wish to dine at three different restaurants. A total of 8 restaurants are available, but only two of the eight serve sea food. However, you as a diner do not know that only two restaurants serve sea food. Find the number of ways in which you can select a restaurant for dining so that at least one of the selected restaurants will serve seafood. Assume that the order of selection is not important.
\n" ); document.write( " at least 1= 1 or more = 1 0r 2 or 3 or 4 or 5 or 6 or 7 or 8 = 8C1+8C2+ 8C3 +8C4+8C5+8C7+8C8= 255
\n" ); document.write( "

Algebra.Com's Answer #257925 by edjones(8007)\"\" \"About 
You can put this solution on YOUR website!
2C2+(2C1)(6C1)
\n" ); document.write( "=1+2*6
\n" ); document.write( "=1+12
\n" ); document.write( "=13 the number of ways in which you can select a restaurant for dining so that at least one of the selected restaurants will serve seafood.
\n" ); document.write( ".
\n" ); document.write( "At least you are trying. You will get it. It's not brain surgery.
\n" ); document.write( ".
\n" ); document.write( "Ed
\n" ); document.write( "
\n" );