document.write( "Question 1026751: 1. Five cards are chosen from a random a standard deck of playing cards. In how many ways can the cards be chosen under each of the following condition.
\n" ); document.write( "a.) all are hearts. b.) Exactly three kings\r
\n" ); document.write( "\n" ); document.write( "2. Use mathematical induction to prove 2+2+8+..+2^n= 2(2^n -1) \r
\n" ); document.write( "\n" ); document.write( "THANK YOUUUUU.
\n" ); document.write( "

Algebra.Com's Answer #642050 by Edwin McCravy(20056)\"\" \"About 
You can put this solution on YOUR website!
1. Five cards are chosen from a random a standard deck of
\n" ); document.write( "playing cards. In how many ways can the cards be chosen
\n" ); document.write( "under each of the following condition.
\n" ); document.write( "a.) all are hearts.
\n" ); document.write( "
\r\n" );
document.write( "13 hearts, CHOOSE 5\r\n" );
document.write( "\r\n" );
document.write( "Answer:  13C5 = \"%2813%2A12%2A11%2A10%2A9%29%2F%281%2A2%2A3%2A4%2A5%29\" = 1287\r\n" );
document.write( "\r\n" );
document.write( "[5 factors in the numerator, coming down from 15, 5 factors in the\r\n" );
document.write( "denominator, coming up from 1.]  \r\n" );
document.write( "

\n" ); document.write( "b.) Exactly three kings
\n" ); document.write( "
\r\n" );
document.write( "Here we have two things to choose, 3 kings and 2 non-kings.\r\n" );
document.write( "\r\n" );
document.write( "First we find the number of ways to choose 3 kings.\r\n" );
document.write( "\r\n" );
document.write( "4 kings, choose 3.  4C3 = \"%284%2A3%2A2%29%2F%281%2A2%2A3%29\" = 4 \r\n" );
document.write( "\r\n" );
document.write( "Next we find the number of ways to choose 2 non-kings.\r\n" );
document.write( "\r\n" );
document.write( "48 non-kings, choose 2 = 48C2 = \"%2848%2A47%29%2F%281%2A2%29\" = 1128\r\n" );
document.write( "\r\n" );
document.write( "Now for each of the 4 ways to choose the 3 kings, there\r\n" );
document.write( "are 1128 ways to choose the 2 non-kings, so we multiply\r\n" );
document.write( "those numbers:\r\n" );
document.write( "\r\n" );
document.write( "4*1128 = 4512\r\n" );
document.write( "\r\n" );
document.write( "---------------------------\r\n" );
document.write( "

\n" ); document.write( "Use mathematical induction to prove 2+2+8+..+2^n= 2(2^n -1)
\n" ); document.write( "
\r\n" );
document.write( "We are to prove P(n) which is\r\n" );
document.write( "\r\n" );
document.write( "\"2%2B2%2B8%2B%22%22%2A%22%22%2A%22%22%2A%22%22%2B2%5En=2%282%5En-1%29\"\r\n" );
document.write( "\r\n" );
document.write( "First let's see what P(k+1) would be: [That's always the first \r\n" );
document.write( "thing to do.  Before you start an induction proof,  you should \r\n" );
document.write( "calculate P(k+1) to see where you're headed]: \r\n" );
document.write( "\r\n" );
document.write( "To do that, replace n by k+1 in \"2%282%5En+-1%29\" to see what P(k+1) \r\n" );
document.write( "is, for that is what we are going for, and if we have that \r\n" );
document.write( "beforehand, we'll know when we have arrived and the proof is \r\n" );
document.write( "finished. \r\n" );
document.write( "\r\n" );
document.write( "Substituting k+1 for n in \"2%282%5En-1%29\", we have \r\n" );
document.write( "\r\n" );
document.write( "\"2%282%5E%28k%2B1%29+-1%29\" = \"2%5E%28k%2B2%29-2\"\r\n" );
document.write( "\r\n" );
document.write( "Now that we know what P(k+1) is, we know where we're going, and we'll \r\n" );
document.write( "know we have arrived if and when we get \"2%5E%28k%2B2%29-2\".  So now we \r\n" );
document.write( "can start the proof: \r\n" );
document.write( "\r\n" );
document.write( "P(1):  substitute n=1, \"2%282%5E1-1%29\" = 2, which is true, because the \r\n" );
document.write( "first term is 2. \r\n" );
document.write( "\r\n" );
document.write( "Assume P(k): \"2%2B2%2B8%2B%22%22%2A%22%22%2A%22%22%2A%22%22%2B2%5Ek+=+2%282%5Ek-1%29\"  \r\n" );
document.write( "\r\n" );
document.write( "We add the next term \"2%5E%28k%2B1%29\" to both sides:\r\n" );
document.write( "\r\n" );
document.write( "\"%22%22=%22%22\" \r\n" );
document.write( "                       \"2%5E%28k%2B1%29-2%2B2%5E%28k%2B1%29\"\"%22%22=%22%22\"\r\n" );
document.write( "                       \"2%2A2%5E%28k%2B1%29-2\"\"%22%22=%22%22\" \r\n" );
document.write( "                       \"2%5E%28k%2B2%29-2\" \r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "and now we see that we get the same P(k+1) as the one that we found \r\n" );
document.write( "in the beginning that we were going for.  So the proof is finished. \r\n" );
document.write( "So since P(1) is true, P(1) proves P(2), P(2) proves P(3), P(3)\r\n" );
document.write( "proves P(4), etc., etc., ad infinitum. \r\n" );
document.write( "\r\n" );
document.write( "Edwin
\r
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );