document.write( "Question 880787: If order is important, how many 2-card hands are possible using a
\n" ); document.write( "standard 52-card deck?
\n" ); document.write( " \n" ); document.write( "
Algebra.Com's Answer #531699 by Edwin McCravy(20060)\"\" \"About 
You can put this solution on YOUR website!
\r\n" );
document.write( "There are 52 ways to pick the card that is to be called CARD NUMBER ONE.\r\n" );
document.write( "\r\n" );
document.write( "For each of those 52 ways to pick CARD NUMBER ONE, there will always be 51 cards\r\n" );
document.write( "remaining to pick to be called \"CARD NUMBER TWO\".\r\n" );
document.write( "\r\n" );
document.write( "Answer 52×51 = 2652 2-card hands if order is important.\r\n" );
document.write( "\r\n" );
document.write( "[Normally we don't distinguish between a 2-card hand consisting of\r\n" );
document.write( "\"3 of spades first and jack of diamonds second\" and \"jack of diamonds first\r\n" );
document.write( "and 3 of spades second\", but in this problem we have to.  When we do consider\r\n" );
document.write( "them different, we call them \"separate permutations\", and when we consider them\r\n" );
document.write( "the same, we call them both \"the same combination\".  There are usually not nearly\r\n" );
document.write( "as many combinations as there are permutations.]. \r\n" );
document.write( "\r\n" );
document.write( "Edwin
\n" ); document.write( "
\n" );